Logic Programming
From MaRDI portal
Publication:5191497
DOI10.1007/b94619zbMath1204.68056OpenAlexW2889864133MaRDI QIDQ5191497
Joohyung Lee, Vladimir Lifschitz
Publication date: 6 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94619
Related Items
A generalization of the Lin-Zhao theorem, Semantic forgetting in answer set programming, A characterization of answer sets for logic programs, Answer set programming based on propositional satisfiability, Model enumeration in propositional circumscription via unsatisfiable core analysis, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Statistical relational extension of answer set programming, Weight constraint programs with evaluable functions, Loop formulas for circumscription, Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs, Magic sets for disjunctive Datalog programs, Loop-separable programs and their first-order definability, Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +, An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems, Answer Set Programming: A Primer, Hyperequivalence of logic programs with respect to supported models, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, Backdoors to tractable answer set programming, ASSAT: computing answer sets of a logic program by SAT solvers
Uses Software
