An A-Prolog Decision Support System for the Space Shuttle

Nogueira, Monica L.; Balduccini, Marcello; Gelfond, Michael; Watson, Richard; Barry, Matthew R.

doi:10.1007/3-540-45241-9_12

Cited by 149 publications

(83 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm (Marek and Truszczynski, 1999;Niemelä, 1999), and has been successfully applied in various domains including space shuttle control (Nogueira et al, 2001), planning (Lifschitz et al, 1999), and the design and implementation of query answering systems (Baral and Scherl, 2004). Syntactically, ASP programs look like Prolog programs, but they are treated by rather different computational mechanisms.…”

Section: Introductionmentioning

confidence: 99%

Answer Set Programming Based on Propositional Satisfiability

2006

View full text Add to dashboard Cite

Abstract. Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced in the past. All these reductions either are limited to a subclass of logic programs, or introduce new variables, or may produce exponentially bigger propositional formulas.In this paper, we present a SAT-based procedure, called ASP-SAT, that (i) deals with any (non disjunctive) logic program, (ii) works on a propositional formula without additional variables (except for those possibly introduced by the clause form transformation), and (iii) is guaranteed to work in polynomial space. From a theoretical perspective, we prove soundness and completeness of ASP-SAT. From a practical perspective, we have (i) implemented ASP-SAT in Cmodels, (ii) extended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and (iii) conducted an extensive comparative analysis involving also other state-of-the-art answer set solvers. The experimental analysis shows that our solver is competitive with the other solvers we considered, and that the reasoning strategies that work best on "small but hard" problems are ineffective on "big but easy" problems and vice versa.

show abstract

Section: Introductionmentioning

confidence: 99%

Answer Set Programming Based on Propositional Satisfiability

2006

View full text Add to dashboard Cite

show abstract

“…This implementation is realized using ASP semantics, based on stable model semantics [10], which is amenable to computationally difficult (e.g., NP-hard) search problems. Let us consider an abstract attack model A (pink thread) and an abstract process model P (white), as shown in Figure 6, where we try to determine if A is a valid attack on P , and if so, in which ways.…”

Section: Methodsmentioning

confidence: 99%

Insider Attack Identification and Prevention Using a Declarative Approach

Sarkar

Köhler

Riddle

et al. 2014

2014 IEEE Security and Privacy Workshops

View full text Add to dashboard Cite

Abstract-A process is a collection of steps, carried out using data, by either human or automated agents, to achieve a specific goal. The agents in our process are insiders; they have access to different data and annotations on data moving in between the process steps. At various points in a process, they can carry out attacks on privacy and/or security of the process through their interactions with different data and annotations, via the steps which they control. These attacks are sometimes difficult to identify as the rogue steps are hidden among the majority of the usual non-malicious steps of the process. We define process models and attack models as dataflow-based directed graphs. An attack A is successful on a process P if there is a mapping relation from A to P that satisfies a number of conditions. These conditions encode the idea that an attack model needs to have a corresponding similarity match in the process model to be successful. We propose a declarative approach to vulnerability analysis. We encode the match conditions using a set of logic rules that define what a valid attack is. Then we implement an approach to generate all possible ways in which agents can carry out a valid attack A on a process P , thus informing the process modeler of vulnerabilities in P . The agents, in addition to acting by themselves, can also collude to carry out an attack. Once A is found to be successful against P , we automatically identify improvement opportunities in P and exploit them, eliminating ways in which A can be carried out against it. The identification uses information about which steps in P are most heavily attacked, and try to find improvement opportunities in them first, before moving onto the lesser attacked ones. We then evaluate the improved P to check if our improvement is successful. This cycle of process improvement and evaluation iterates until A is completely thwarted in all possible ways.

show abstract

“…Among the great number of applications of Answer Set Programming [6] in the fields of planning [5,15], verification, model checking, configuration [19] as well as diagnostic systems and inconsistency management [4], especially some industrial and innovative application areas [7,11,18] have to be mentioned.…”

Section: Answer Set Programmingmentioning

confidence: 99%

Using Answer Set Programming for the Automatic Compilation of Assessment Tests

Schwaiger

Freitag

2006

Logic Programming

View full text Add to dashboard Cite

Abstract. Life-long learning is more and more playing a key role for economical, personal and social success. Therefore the management and development of skills and knowledge is of premier importance in industry and, on the other hand, a major expense factor. So called examination management systems assist teachers and trainers through an automatic compilation of documents, in particular assessment tests, based on user defined requirements and constraints and thus help reduce costs.In this paper we present and discuss a solution of the underlying general problem using Answer Set Programming and show the power and advantages of our approach.

show abstract

An A-Prolog Decision Support System for the Space Shuttle

Cited by 149 publications

References 11 publications

Answer Set Programming Based on Propositional Satisfiability

Answer Set Programming Based on Propositional Satisfiability

Insider Attack Identification and Prevention Using a Declarative Approach

Using Answer Set Programming for the Automatic Compilation of Assessment Tests

Contact Info

Product

Resources

About