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 41 items.
- ASSAT (Q15063) (← links)
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (Q352963) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Stable models and circumscription (Q543596) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Loop-separable programs and their first-order definability (Q543631) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Equilibrium logic (Q854969) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- Integrating answer set programming and constraint logic programming (Q1028649) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
- Rough set reasoning using answer set programs (Q2237125) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
- Enhancing DLV instantiator by backjumping techniques (Q2426106) (← links)
- A general first-order solution to the ramification problem with cycles (Q2446550) (← links)
- A characterization of answer sets for logic programs (Q2644415) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs (Q2835899) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- The Intelligent Grounder of DLV (Q2900523) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework (Q3011967) (← links)
- Transition systems for model generators—A unifying approach (Q3087449) (← links)
- Automatic network reconstruction using ASP (Q3087459) (← links)
- Implementing Prioritized Merging with ASP (Q3163981) (← links)
- Using answer set programming to deal with Boolean networks and attractor computation: application to gene regulatory networks of cells (Q6059225) (← links)
