ASSAT: computing answer sets of a logic program by SAT solvers (Q814607): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop formulas for circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programs with stable model semantics as a constraint programming paradigm / 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: Q4230728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative belief revision in extended logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Davis-Putnam method / rank
 
Normal rank

Latest revision as of 11:02, 24 June 2024

scientific article
Language Label Description Also known as
English
ASSAT: computing answer sets of a logic program by SAT solvers
scientific article

    Statements

    ASSAT: computing answer sets of a logic program by SAT solvers (English)
    0 references
    0 references
    0 references
    7 February 2006
    0 references
    0 references
    Answer set programming
    0 references
    Answer set semantics
    0 references
    Stable model semantics
    0 references
    Logic programming
    0 references
    SAT solvers
    0 references
    0 references
    0 references
    0 references
    0 references