On elementary loops of logic programs (Q2884258): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ASSAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1012.5847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASSAT: computing answer sets of a logic program by SAT solvers / 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: Why are there so many loop formulas? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested expressions in 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: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and knowledge representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DLV system for knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reductive Semantics of Aggregates in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop formulas for circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing disjunctive logic programming systems by SAT checkers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding partiality and disjunctions in stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some (in)translatability results for normal logic programs and propositional theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure in the head / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Head-Elementary-Set-Free Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable models and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of identifying head-elementary-set-free programs / rank
 
Normal rank

Latest revision as of 07:14, 5 July 2024

scientific article
Language Label Description Also known as
English
On elementary loops of logic programs
scientific article

    Statements

    On elementary loops of logic programs (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2012
    0 references
    0 references
    stable model semantics
    0 references
    loop formulas
    0 references
    unfounded sets
    0 references
    0 references