The following pages link to Logic Programming (Q5191497):
Displaying 20 items.
- Loop-separable programs and their first-order definability (Q543631) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Loop formulas for circumscription (Q2457644) (← links)
- A characterization of answer sets for logic programs (Q2644415) (← links)
- Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs (Q2835899) (← 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)
- Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (Q4649728) (← links)
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- Computationally hard problems for logic programs under answer set semantics (Q6636616) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)
