On the computational cost of disjunctive logic programming: Propositional case (Q1924780): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59259761 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized disjunctive well-founded semantics for logic programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General logical databases and programs: Default logic semantics and stratification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation by default and unstratifiable logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressiveness of locally stratified programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of model checking for circumscriptive formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional closed world reasoning and circumscription / 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: Horn clause queries and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4022222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure: careful closure procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between circumscription and negation as failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard problems for simple default logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016556 / 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: How complicated is the set of stable models of a recursive logic program? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / 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: Q3477931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical considerations on nonmonotonic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-valued nonmonotonic formalisms and semantics of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak generalized closed world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring negative information from disjunctive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / 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: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction in non-Horn databases / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:22, 24 May 2024

scientific article
Language Label Description Also known as
English
On the computational cost of disjunctive logic programming: Propositional case
scientific article

    Statements

    On the computational cost of disjunctive logic programming: Propositional case (English)
    0 references
    0 references
    0 references
    25 March 1997
    0 references
    disjunctive logic programming
    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
    0 references
    0 references

    Identifiers