Closed world assumption for disjunctive reasoning (Q5959358): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation-based abduction in disjunctive logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of (disjunctive) logic programs based on partial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static semantics for normal and disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension to linear resolution with selection function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abductive approach to disjunctive logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / 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: Q3983045 / rank
 
Normal rank

Revision as of 00:02, 4 June 2024

scientific article; zbMATH DE number 1723829
Language Label Description Also known as
English
Closed world assumption for disjunctive reasoning
scientific article; zbMATH DE number 1723829

    Statements