Pages that link to "Item:Q814607"
From MaRDI portal
The following pages link to ASSAT: computing answer sets of a logic program by SAT solvers (Q814607):
Displaying 44 items.
- A Pearl on SAT Solving in Prolog (Q3558337) (← links)
- Catching the Ouroboros: On debugging non-ground answer-set programs (Q3585165) (← links)
- Loop formulas for description logic programs (Q3585166) (← links)
- Testing and debugging techniques for answer set solver development (Q3585183) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- Probabilistic reasoning with answer sets (Q3612603) (← links)
- Merging Belief Bases Represented by Logic Programs (Q3638164) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (Q3638568) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- <tt>ASPeRiX</tt>, a first-order forward chaining approach for answer set computing (Q4593088) (← links)
- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (Q4649728) (← links)
- Reducing fuzzy answer set programming to model finding in fuzzy logics (Q4897702) (← links)
- Conflict-driven ASP solving with external sources (Q4911141) (← links)
- Omission-Based Abstraction for Answer Set Programs (Q4957218) (← links)
- (Q5020979) (← links)
- Using Answer Set Programming for Commonsense Reasoning in the Winograd Schema Challenge (Q5108519) (← links)
- Answering the “why” in answer set programming – A survey of explanation approaches (Q5197747) (← links)
- Answer Set Enumeration via Assumption Literals (Q5215367) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)
- Parallel instantiation of ASP programs: techniques and experiments (Q5299587) (← links)
- Lloyd-Topor completion and general stable models (Q5398291) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424888) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424889) (← links)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets (Q5445291) (← links)
- Twelve Definitions of a Stable Model (Q5504644) (← links)
- Quo Vadis Answer Set Programming? (Q5504648) (← links)
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There (Q5504650) (← links)
- Engineering an Incremental ASP Solver (Q5504656) (← links)
- Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories (Q5504667) (← links)
- Abstract Answer Set Solvers (Q5504668) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705919) (← links)
- RegSTAB: A SAT Solver for Propositional Schemata (Q5747769) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells (Q6059225) (← links)
- Itauto: An Extensible Intuitionistic SAT Solver (Q6157250) (← links)
- Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
- Logic programming (Q6602251) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
