Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Arithmetic classification of perfect models of stratified programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Handbook of theoretical computer science (vol. B)
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Reasoning about termination of pure Prolog programs
Information and Computation
On the occur-check-free PROLOG programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Circumscribing DATALOG: expressive power and complexity
Theoretical Computer Science
Artificial Intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Reasoning with infinite stable models
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Theory and Practice of Logic Programming
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
My work with Victor Marek: a mathematician looks at answer set programming
Annals of Mathematics and Artificial Intelligence
Exploiting conjunctive queries in description logic programs
Annals of Mathematics and Artificial Intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Data integration and answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Hi-index | 0.00 |
Schlipf (1995) proved that Stable Logic Programming (SLP) solves all $\mathit{NP}$ decision problems. We extend Schlipf's result to prove that SLP solves all search problems in the class $\mathit{NP}$. Moreover, we do this in a uniform way as defined in Marek and Truszczyński (1991). Specifically, we show that there is a single $\mathrm{DATALOG}^{\neg}$ program $P_{\mathit{Trg}}$ such that given any Turing machine $M$, any polynomial $p$ with non-negative integer coefficients and any input $\sigma$ of size $n$ over a fixed alphabet $\Sigma$, there is an extensional database $\mathit{edb}_{M,p,\sigma}$ such that there is a one-to-one correspondence between the stable models of $\mathit{edb}_{M,p,\sigma} \cup P_{\mathit{Trg}}$ and the accepting computations of the machine $M$ that reach the final state in at most $p(n)$ steps. Moreover, $\mathit{edb}_{M,p,\sigma}$ can be computed in polynomial time from $p$, $\sigma$ and the description of $M$ and the decoding of such accepting computations from its corresponding stable model of $\mathit{edb}_{M,p,\sigma} \cup P_{\mathit{Trg}}$ can be computed in linear time. A similar statement holds for Default Logic with respect to $\Sigma_2^\mathrm{P}$-search problems.