ASSAT: computing answer sets of a logic program by SAT solvers
From MaRDI portal
Recommendations
Cites work
- Depth-First Search and Linear Graph Algorithms
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 1249657 (Why is no real title available?)
- scientific article; zbMATH DE number 2088041 (Why is no real title available?)
- Implementing the Davis-Putnam method
- Iterative belief revision in extended logic programming
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with stable model semantics as a constraint programming paradigm
- Loop formulas for circumscription
- Propositional semantics for disjunctive logic programs
Cited in
(only showing first 100 items - show all)- Evaluating ASP and commercial solvers on the CSPLib
- On the relation among answer set solvers
- Integrating answer set programming and constraint logic programming
- ASSAT
- A progression semantics for first-order logic programs
- What is answer set programming to propositional satisfiability
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Disjunctive logic programs, answer sets, and the cut rule
- Graph-based construction of minimal models
- Recursive rules with aggregation: a simple unified semantics
- Rough set reasoning using answer set programs
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Backdoors to tractable answer set programming
- Semantic forgetting in answer set programming
- On look-ahead heuristics in disjunctive logic programming
- Enhancing DLV instantiator by backjumping techniques
- A general first-order solution to the ramification problem with cycles
- A characterization of answer sets for logic programs
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- raSAT: An SMT Solver for Polynomial Constraints
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- On elementary loops of logic programs
- The intelligent grounder of DLV
- SAT modulo graphs: acyclicity
- Improving the normalization of weight rules in answer set programs
- Computing loops with at most one external support rule
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
- Transition systems for model generators -- a unifying approach
- Automatic network reconstruction using ASP
- 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
- Integrating Inductive Definitions in SAT
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- Multivalued action languages with constraints in CLP(FD)
- A Pearl on SAT Solving in Prolog
- 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
- Probabilistic reasoning with answer sets
- 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
- Some (in)translatability results for normal logic programs and propositional theories
- Ordered completion for first-order logic programs on finite structures
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Knowledge compilation of logic programs using approximation fixpoint theory
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Computing loops with at most one external support rule for disjunctive logic programs
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- scientific article; zbMATH DE number 2090539 (Why is no real title available?)
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Conflict-driven ASP solving with external sources
- Omission-based abstraction for answer set programs
- scientific article; zbMATH DE number 7455719 (Why is no real title available?)
- Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
- Logic Programming
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Answer set enumeration via assumption literals
- Model enumeration via assumption literals
- Why are there so many loop formulas?
- Backdoors to normality for disjunctive logic programs
- Expressiveness of logic programs under the general stable model semantics
- Parallel instantiation of ASP programs: techniques and experiments
- Lloyd-Topor completion and general stable models
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Stable models and circumscription
- Semantics and complexity of recursive aggregates in answer set programming
- Loop-separable programs and their first-order definability
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming
- 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
- Logic for Programming, Artificial Intelligence, and Reasoning
- RegSTAB: A SAT Solver for Propositional Schemata
- Abstraction for non-ground answer set programs
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells
- Statistical relational extension of answer set programming
- Itauto: An Extensible Intuitionistic SAT Solver
- Weight constraint programs with evaluable functions
- Aspmc: new frontiers of algebraic answer set counting
- Logic programming
- Computationally hard problems for logic programs under answer set semantics
- IASCAR: incremental answer set counting by anytime refinement
- On CNF conversion for SAT and SMT enumeration
This page was built for publication: ASSAT: computing answer sets of a logic program by SAT solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814607)
