The following pages link to Cmodels (Q16611):
Displaying 50 items.
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Equilibrium logic (Q854969) (← links)
- Possibilistic uncertainty handling for answer set programming (Q854974) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← 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)
- Stable models and difference logic (Q1028651) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← 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)
- Enhancing DLV instantiator by backjumping techniques (Q2426106) (← links)
- Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs (Q2835899) (← links)
- The Intelligent Grounder of DLV (Q2900523) (← links)
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses (Q3001916) (← links)
- (Q3100235) (← links)
- (Q3100241) (← links)
- The Significance of Memory Costs in Answer Set Solver Implementation (Q3395262) (← links)
- GASP: Answer Set Programming with Lazy Grounding (Q3400569) (← links)
- (Q3413498) (← links)
- Experimenting with parallelism for the instantiation of ASP programs (Q3527693) (← links)
- Answer Set Programming: A Declarative Approach to Solving Search Problems (Q3533116) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- (Q3624060) (← links)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (Q3638568) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- Disjunctive answer set solvers via templates (Q4593037) (← links)
- Anytime answer set optimization via unsatisfiable core shrinking (Q4593041) (← links)
- (Q4906890) (← links)
- Efficiently Coupling the I-DLV Grounder with ASP Solvers (Q4957193) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- (Q5020979) (← links)
- (Q5020995) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)
- (Q5294160) (← links)
- Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming (Q5297630) (← links)
- Logic Programming (Q5313190) (← links)
