default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIJCSLP 1992 Workshop on Structural Complexity and Recursion-theoretic methods in Logic-Programming
- Howard A. Blair, V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, Washington, DC, USA, November 13, 1992. Mathematical Sciences Institute, Cornell University 1992 - Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier:
Halting Problem of One Binary Horn Clause id Undecidable. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 5-14 - Jürgen Dix, Martin Müller:
Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 15-28 - Thomas Eiter, Georg Gottlob:
Complexity Results for Logic-Based Abduction. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 29-44 - Audrey Ferry:
A Topological Characterization of the Stable and Minimal Model Classes of Propositional Logical Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 45-68 - V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel:
Rule Systems and Well-Orderings. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 69-92 - V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski:
Complexity of Computing with Extended Propositional Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 93-102 - Yael Moscowitz, Ehud Shapiro:
On the Structural Simplicity of Machines and Languages. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 103-120 - Inderpal Singh Mumick, Oded Shmueli:
Aggregation, Computability, and Complete Query Languages. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 121-142 - John S. Schlipf:
A Survey of Complexity and Undecidability Results in Logic Programming. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 143-164 - Andrei Voronkov:
On Computability by Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 165-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
