Loop formulas for circumscription (Q2457644): Difference between revisions

From MaRDI portal
Changed an 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: CCalc / 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.2005.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123741728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing the Zoo World and the Traffic World in the language of the Causal Calculator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscription revisited: A reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic causal theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set programming based on propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / 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: Q2734935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4514010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the logic of causal explanation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongest necessary and weakest sufficient conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002238 / rank
 
Normal rank

Latest revision as of 11:40, 27 June 2024

scientific article
Language Label Description Also known as
English
Loop formulas for circumscription
scientific article

    Statements

    Loop formulas for circumscription (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    Nonmonotonic reasoning
    0 references
    Commonsense reasoning
    0 references
    Knowledge representation
    0 references
    Circumscription
    0 references
    Clark's completion
    0 references
    Loop formulas
    0 references
    Logic programming
    0 references
    0 references
    0 references

    Identifiers