Results 1  10
of
40
Satbased answer set programming
 In Proc. AAAI04
, 2004
"... The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either ..."
Abstract

Cited by 32 (8 self)
 Add to MetaCart
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a onetoone correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems. In this paper we present a SATbased decision procedure for answer set programming that (i) deals with any (non disjunctive) logic program, (ii) works on a SAT formula without additional variables, and (iii) is guaranteed to work in polynomial space. Further, our procedure can be extended to compute all the answer sets still working in polynomial space. The experimental results of a prototypical implementation show that the approach can pay off sometimes by orders of magnitude.
Conflictdriven disjunctive answer set solving
 IN KR’08, AAAI PRESS
, 2008
"... We elaborate a uniform approach to computing answer sets of disjunctive logic programs based on stateoftheart Boolean constraint solving techniques. Starting from a constraintbased characterization of answer sets, we develop advanced solving algorithms, featuring backjumping and conflictdriven l ..."
Abstract

Cited by 26 (10 self)
 Add to MetaCart
We elaborate a uniform approach to computing answer sets of disjunctive logic programs based on stateoftheart Boolean constraint solving techniques. Starting from a constraintbased characterization of answer sets, we develop advanced solving algorithms, featuring backjumping and conflictdriven learning using the FirstUIP scheme as well as sophisticated unfounded set checking. As a final result, we obtain a competitive solver for Σ P 2complete problems, taking advantage of Boolean constraint solving technology without using any legacy solvers as black boxes.
The ConflictDriven Answer Set Solver clasp: Progress Report
"... Abstract. We summarize the salient features of the current version of the answer set solver clasp, focusing on the progress made since version RC4 of clasp. Apart from enhanced preprocessing and searchsupporting techniques, a particular emphasis lies on advanced reasoning modes, such as cautious an ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Abstract. We summarize the salient features of the current version of the answer set solver clasp, focusing on the progress made since version RC4 of clasp. Apart from enhanced preprocessing and searchsupporting techniques, a particular emphasis lies on advanced reasoning modes, such as cautious and brave reasoning, optimization, solution projection, and incremental solving. 1
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming ⋆
"... Abstract. We introduce an approach to detecting inconsistencies in large biological networks by using Answer Set Programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reactions and highthroughput profiles of cell activity. We then present an a ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
Abstract. We introduce an approach to detecting inconsistencies in large biological networks by using Answer Set Programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reactions and highthroughput profiles of cell activity. We then present an approach based on Answer Set Programming to check the consistency of largescale data sets. Moreover, we extend this methodology to provide explanations for inconsistencies in the data by determining minimal representations of conflicts. In practice, this can be used to identify unreliable data or to indicate missing reactions. 1
Advances in gringo series 3
 Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’11), 345– 351
, 2011
"... Abstract. We describe the major new features emerging from a significant redesign of the grounder gringo, building upon a grounding algorithm based on seminaive database evaluation. Unlike previous versions, rules only need to be safe rather than domainrestricted. 1 ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Abstract. We describe the major new features emerging from a significant redesign of the grounder gringo, building upon a grounding algorithm based on seminaive database evaluation. Unlike previous versions, rules only need to be safe rather than domainrestricted. 1
S.: On the input language of ASP grounder Gringo
 Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’09). Volume 5753 of Lecture Notes in Artificial Intelligence., SpringerVerlag (2009) 502–508
"... Abstract. We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime reached maturity and offers a rich modeling language to program developers. The attractiveness of Gringo is f ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime reached maturity and offers a rich modeling language to program developers. The attractiveness of Gringo is fostered by the fact that it significantly extends the input language of Lparse while supporting a compatible output format, recognized by many stateoftheart ASP solvers. 1
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
"... Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus and temporal action logics; the latter has served as a basis ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus and temporal action logics; the latter has served as a basis of a family of action languages, such as language A and several of its descendants. Based on the discovery that circumscription and the stable model semantics coincide on a class of canonical formulas, we reformulate the situation calculus and the event calculus in the general theory of stable models. We also present a translation that turns the reformulations further into answer set programs, so that efficient answer set solvers can be applied to compute the situation calculus and the event calculus. 1.
The SeaLion has landed: An IDE for answerset programming
 IN: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON APPLICATIONS OF DECLARATIVE PROGRAMMING AND KNOWLEDGE MANAGEMENT (INAP 2011) AND THE 25TH WORKSHOP ON LOGIC PROGRAMMING (WLP
, 2011
"... We report about the current state and designated features of the tool SeaLion, aimed to serve as an integrated development environment (IDE) for answerset programming (ASP). A main goal of SeaLion is to provide a userfriendly environment for supporting a developer to write, evaluate, debug, and ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We report about the current state and designated features of the tool SeaLion, aimed to serve as an integrated development environment (IDE) for answerset programming (ASP). A main goal of SeaLion is to provide a userfriendly environment for supporting a developer to write, evaluate, debug, and test answerset programs. To this end, new support techniques have to be developed that suit the requirements of the answerset semantics and meet the constraints of practical applicability. In this respect, SeaLion benefits from the research results of a project on methods and methodologies for answerset program development in whose context SeaLion is realised. Currently, the tool provides sourcecode editors for the languages of Gringo and DLV that offer syntax highlighting, syntax checking, and a visual program outline. Further implemented features are support for external solvers and visualisation as well as visual editing of answer sets. SeaLion comes as a plugin of the popular Eclipse platform and provides itself interfaces for future extensions of the IDE.
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
"... Abstract. We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formulas of loops with no external support can be computed in polynomial time, and if the given program has no constr ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formulas of loops with no external support can be computed in polynomial time, and if the given program has no constraints, an iterative procedure based on these formulas, the program completion, and unit propagation computes the least fixed point of a simplification operator used by DLV. We also relate loops with no external supports to the unfounded sets and the wellfounded semantics of disjunctive logic programs by Wang and Zhou. However, the problem of computing loop formulas of loops with at most one external support rule is NPhard for disjunctive logic programs. We thus propose a polynomial algorithm for computing some of these loop formulas, and show experimentally that this polynomial approximation algorithm can be effective in practice. 1