Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The Stable Models of a Predicate Logic Program

From MaRDI portal
Publication:4318872
Jump to:navigation, search

DOI10.1016/S0743-1066(14)80008-3zbMath0836.68013OpenAlexW2047885920MaRDI QIDQ4318872

Victor W. Marek, Anil Nerode, Jeffery B. Remmel

Publication date: 6 February 1995

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(14)80008-3

zbMATH Keywords

Turing degreesTuring complexityfinite predicate logic program


Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)


Related Items

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols, Complexity and undecidability results for logic programming, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs, Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics, Automata and Answer Set Programming, My work with Victor Marek: a mathematician looks at answer set programming, Logic programs, well-orderings, and forward chaining, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Composing Normal Programs with Function Symbols, Logic programming with infinite sets



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4318872&oldid=18268330"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 21:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki