Complexity and undecidability results for logic programming (Q1924779): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3960112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressiveness of locally stratified programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of complexity results for non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematics of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kripke-kleene semantics for logic programs* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point extensions of first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of stratified logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why not negation by fixpoint? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How complicated is the set of stable models of a recursive logic program? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of nonmonotonic rule systems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Models of a Predicate Logic Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tie-breaking semantics and structural totality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and definability with circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing a logic for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commonsense axiomatizations for logic programs / rank
 
Normal rank

Latest revision as of 14:22, 24 May 2024

scientific article
Language Label Description Also known as
English
Complexity and undecidability results for logic programming
scientific article

    Statements

    Complexity and undecidability results for logic programming (English)
    0 references
    0 references
    25 March 1997
    0 references
    degree of uncomputability
    0 references
    expressive power
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers