Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731): 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: Smodels / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1810243429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702577 / 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: Logic programming and knowledge representation---The A-Prolog perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly equivalent logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested expressions in logic programs / 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 theories are strongly equivalent to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of the disjunctive stable semantics by partial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperequivalence of logic programs with respect to supported models / rank
 
Normal rank

Latest revision as of 21:25, 5 July 2024

scientific article; zbMATH DE number 6105006
Language Label Description Also known as
English
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
scientific article; zbMATH DE number 6105006

    Statements

    Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (English)
    0 references
    13 November 2012
    0 references
    0 references
    stable models
    0 references
    answer-set programming
    0 references
    logic here-and-there
    0 references
    0 references