Computing the well-founded semantics faster (Q5101445): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4327612 / 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: A kripke-kleene semantics for logic programs* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological approach to dynamic graph connectivity / 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: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank

Latest revision as of 00:07, 30 July 2024

scientific article; zbMATH DE number 7577923
Language Label Description Also known as
English
Computing the well-founded semantics faster
scientific article; zbMATH DE number 7577923

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references