Evaluating epistemic negation in answer set programming (Q286399): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Combining answer set programming with description logics for the semantic web / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics and complexity of recursive aggregates in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manifold Answer-Set Programs and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable models and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Semantics for Epistemic Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and reasoning with incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The language of epistemic specifications (refined) including a prototype solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thirteen Definitions of a Stable Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested expressions in logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconciling description logics and rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-founded and stable semantics of logic programs with aggregates / rank
 
Normal rank
Property / cites work
 
Property / cites work: FLP answer set semantics without circular justifications for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Epistemic Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / 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 with Graded Modality / rank
 
Normal rank

Revision as of 00:23, 12 July 2024

scientific article
Language Label Description Also known as
English
Evaluating epistemic negation in answer set programming
scientific article

    Statements

    Evaluating epistemic negation in answer set programming (English)
    0 references
    0 references
    0 references
    20 May 2016
    0 references
    answer set programming
    0 references
    epistemic negation
    0 references
    semantics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references