Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ASSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Smodels / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ANTON / 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.1016/j.artint.2010.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072190298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set based design of knowledge systems / 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: Propositional theories are strongly equivalent to logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Nonmonotonic Knowledge Bases with External Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical characterizations and complexity of equivalences in answer set 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: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of aggregate functions in the DLV system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight constraints as nested expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007261 / 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: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic causal 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: On Reductive Semantics of Aggregates in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Answer Set Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly equivalent logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested expressions in logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical considerations on nonmonotonic logic / 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: Q2734950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified Equilibrium Logic and Foundations for Answer Set Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming for Multiagent Planning with Negotiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperequivalence of logic programs with respect to supported models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equivalence made easy: nested expressions and weight constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common view on strong, uniform, and other notions of equivalence in answer-set programming / rank
 
Normal rank

Latest revision as of 17:48, 3 July 2024

scientific article
Language Label Description Also known as
English
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
scientific article

    Statements

    Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (English)
    0 references
    31 January 2011
    0 references
    logic programming
    0 references
    stable models
    0 references
    supported models
    0 references
    reducts
    0 references
    logic HT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers