The complexity of predicate default logic over a countable domain (Q1861328): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3773876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of open default theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions for open default theories via the domain closure assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-world databases and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3486550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic of knowledge and justified assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of nonmonotonic rule systems I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of nonmonotonic rule systems. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273952 / 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: Non-monotonic logic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and definability with circumscription / rank
 
Normal rank

Latest revision as of 13:47, 5 June 2024

scientific article
Language Label Description Also known as
English
The complexity of predicate default logic over a countable domain
scientific article

    Statements

    The complexity of predicate default logic over a countable domain (English)
    0 references
    16 March 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    default logic
    0 references
    circumscription
    0 references
    computability theoretic complexity
    0 references