ASSAT: computing answer sets of a logic program by SAT solvers
From MaRDI portal
Recommendations
Cites work
- 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?)
- Depth-First Search and Linear Graph Algorithms
- 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)- Graph-based construction of minimal models
- Backdoors to tractable answer set programming
- A Pearl on SAT Solving in Prolog
- Weight constraint programs with evaluable functions
- Rough set reasoning using answer set programs
- Enhancing DLV instantiator by backjumping techniques
- Disjunctive logic programs, answer sets, and the cut rule
- Probabilistic Reasoning by SAT Solvers
- Advances in WASP
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Semantic forgetting in answer set programming
- Transition systems for model generators -- a unifying approach
- Evaluating ASP and commercial solvers on the CSPLib
- The loop formula based semantics of description logic programs
- Expressiveness of logic programs under the general stable model semantics
- Thirteen Definitions of a Stable Model
- Stable models and circumscription
- Integrating answer set programming and constraint logic programming
- On the relation among answer set solvers
- The intelligent grounder of DLV
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Loop-separable programs and their first-order definability
- Ordered completion for first-order logic programs on finite structures
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- Backdoors to normality for disjunctive logic programs
- Improving the normalization of weight rules in answer set programs
- Recursive rules with aggregation: a simple unified semantics
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
- Probabilistic reasoning with answer sets
- Answer set programming based on propositional satisfiability
- The Design of the Sixth Answer Set Programming Competition
- Logic Programming and Nonmonotonic Reasoning
- Knowledge compilation of logic programs using approximation fixpoint theory
- Loop formulas for description logic programs
- Catching the Ouroboros: on debugging non-ground answer-set programs
- Answer Set Programming: A Primer
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
- ASSAT
- Conflict-driven ASP solving with external sources
- A generalization of the Lin-Zhao theorem
- A progression semantics for first-order logic programs
- Design and results of the Fifth Answer Set Programming Competition
- Some (in)translatability results for normal logic programs and propositional theories
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- Logic Programming and Nonmonotonic Reasoning
- Automatic network reconstruction using ASP
- Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
- Logic Programming
- Logic Programming
- What is answer set programming to propositional satisfiability
- Quo Vadis Answer Set Programming?
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- A characterization of answer sets for logic programs
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Why are there so many loop formulas?
- Abstract Answer Set Solvers
- Semantics and complexity of recursive aggregates in answer set programming
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Equilibrium logic
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Engineering an Incremental ASP Solver
- On elementary loops of logic programs
- Computing loops with at most one external support rule for disjunctive logic programs
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- raSAT: An SMT Solver for Polynomial Constraints
- Progress in clasp series 3
- Merging Belief Bases Represented by Logic Programs
- Twelve Definitions of a Stable Model
- RegSTAB: A SAT Solver for Propositional Schemata
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Answer set enumeration via assumption literals
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- scientific article; zbMATH DE number 2090539 (Why is no real title available?)
- Parallel instantiation of ASP programs: techniques and experiments
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells
- Computing loops with at most one external support rule
- On look-ahead heuristics in disjunctive logic programming
- Integrating Inductive Definitions in SAT
- Implementing prioritized merging with ASP
- SAT modulo graphs: acyclicity
- Logic programming
- Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge
- Abstraction for non-ground answer set programs
- Itauto: An Extensible Intuitionistic SAT Solver
- Logic Programming and Nonmonotonic Reasoning
- Lloyd-Topor completion and general stable models
- A general first-order solution to the ramification problem with cycles
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Computationally hard problems for logic programs under answer set semantics
- {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
- Testing and debugging techniques for answer set solver development
- Model enumeration via assumption literals
- Answering the ``why in answer set programming -- a survey of explanation approaches
- Omission-based abstraction for answer set programs
- Aspmc: new frontiers of algebraic answer set counting
- ASP solving for expanding universes
- Statistical relational extension of answer set programming
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)
