Complexity and undecidability results for logic programming
type: Item
instance of: scholarly article
title: Complexity and undecidability results for logic programming
zbMATH Open document ID: 0858.68015
DOI: 10.1007/BF01536398
author: John S. Schlipf
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-03-25T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 937276
zbMATH Keywords: degree of uncomputability
zbMATH Keywords: expressive power
MaRDI profile type: Publication
cites work: Q3960112
cites work: Q3477998
cites work: Q4075450
cites work: The expressiveness of locally stratified programs
cites work: A survey of complexity results for non-monotonic logics
cites work: Structure and complexity of relational queries
cites work: Contributions to the Theory of Logic Programming
cites work: Q4318639
cites work: The mathematics of non-monotonic reasoning
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q4052071
cites work: A kripke-kleene semantics for logic programs*
cites work: Fixed-point extensions of first-order logic
cites work: Relational queries computable in polynomial time
cites work: The expressive power of stratified logic programs
cites work: Why not negation by fixpoint?
cites work: Negation in logic programming
cites work: Q3478001
cites work: Q5750390
cites work: Q3992908
cites work: Circumscription - a form of non-monotonic reasoning
cites work: Q3939270
cites work: How complicated is the set of stable models of a recursive logic program?
cites work: A theory of nonmonotonic rule systems. II
cites work: The Stable Models of a Predicate Logic Program
cites work: Autoepistemic logic
cites work: Tie-breaking semantics and structural totality
cites work: Decidability and definability with circumscription
cites work: Formalizing a logic for logic programming
cites work: A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
cites work: Negation as failure. II
cites work: Q5750391
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Q3348436
cites work: The well-founded semantics for general logic programs
cites work: Commonsense axiomatizations for logic programs
description: scientific article; zbMATH DE number 937276