ASSAT: computing answer sets of a logic program by SAT solvers
From MaRDI portal
Publication:814607
DOI10.1016/j.artint.2004.04.004zbMath1085.68544OpenAlexW2004414305MaRDI QIDQ814607
Publication date: 7 February 2006
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2004.04.004
Related Items
Backdoors to Normality for Disjunctive Logic Programs, Expressiveness of Logic Programs under the General Stable Model Semantics, On elementary loops of logic programs, Implementing Prioritized Merging with ASP, Advances in WASP, ASP Solving for Expanding Universes, Progress in clasp Series 3, The Design of the Sixth Answer Set Programming Competition, The Intelligent Grounder of DLV, Parallel instantiation of ASP programs: techniques and experiments, Recursive rules with aggregation: a simple unified semantics, A generalization of the Lin-Zhao theorem, Equilibrium logic, Semantic forgetting in answer set programming, A characterization of answer sets for logic programs, Answer set programming based on propositional satisfiability, Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction, SAT Modulo Graphs: Acyclicity, Improving the Normalization of Weight Rules in Answer Set Programs, Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, A progression semantics for first-order logic programs, Integrating Inductive Definitions in SAT, Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells, Model enumeration in propositional circumscription via unsatisfiable core analysis, SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions, Knowledge compilation of logic programs using approximation fixpoint theory, ASPeRiX, a first-order forward chaining approach for answer set computing, Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge, Statistical relational extension of answer set programming, On look-ahead heuristics in disjunctive logic programming, Enhancing DLV instantiator by backjumping techniques, Design and results of the Fifth Answer Set Programming Competition, Ordered completion for first-order logic programs on finite structures, What is answer set programming to propositional satisfiability, Weight constraint programs with evaluable functions, Unnamed Item, On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability, A general first-order solution to the ramification problem with cycles, atalog: A logic language for expressing search and optimization problems, Multivalued action languages with constraints in CLP(FD), Reducing fuzzy answer set programming to model finding in fuzzy logics, Lloyd-Topor completion and general stable models, Rough set reasoning using answer set programs, Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework, Conflict-driven ASP solving with external sources, Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs, Conflict-driven answer set solving: from theory to practice, Magic sets for disjunctive Datalog programs, Stable models and circumscription, Semantics and complexity of recursive aggregates in answer set programming, Loop-separable programs and their first-order definability, Catching the Ouroboros: On debugging non-ground answer-set programs, Loop formulas for description logic programs, Testing and debugging techniques for answer set solver development, Thirteen Definitions of a Stable Model, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Answering the “why” in answer set programming – A survey of explanation approaches, Probabilistic reasoning with answer sets, Omission-Based Abstraction for Answer Set Programs, Abstraction for non-ground answer set programs, Transition systems for model generators—A unifying approach, Automatic network reconstruction using ASP, ASSAT, Evaluating ASP and commercial solvers on the CSPLib, Merging Belief Bases Represented by Logic Programs, Probabilistic Reasoning by SAT Solvers, An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems, Answer Set Programming: A Primer, On the relation among answer set solvers, Integrating answer set programming and constraint logic programming, The loop formula based semantics of description logic programs, Some (in)translatability results for normal logic programs and propositional theories, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Disjunctive logic programs, answer sets, and the cut rule, Twelve Definitions of a Stable Model, Quo Vadis Answer Set Programming?, Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There, Engineering an Incremental ASP Solver, Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories, Abstract Answer Set Solvers, Graph-based construction of minimal models, Backdoors to tractable answer set programming
Uses Software
Cites Work
- Iterative belief revision in extended logic programming
- Propositional semantics for disjunctive logic programs
- Implementing the Davis-Putnam method
- Logic programs with stable model semantics as a constraint programming paradigm
- Loop formulas for circumscription
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Depth-First Search and Linear Graph Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
