A theory of nonmonotonic rule systems. II (Q1354038): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing nonmonotonic reasoning systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable retracing functions and \(\Pi_2^0\) predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: ∏ 0 1 Classes and Degrees of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of members of \(\Pi_ 1^ 0\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall) / 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: How complicated is the set of stable models of a recursive logic program? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank

Latest revision as of 12:25, 27 May 2024

scientific article
Language Label Description Also known as
English
A theory of nonmonotonic rule systems. II
scientific article

    Statements

    A theory of nonmonotonic rule systems. II (English)
    0 references
    0 references
    13 May 1997
    0 references
    Nonmonotonic logics have become an extensive research area in computer science. Among such logics are Default Logic, Logic Programming with Negation as Failure, Autoepistemic Logic, and Truth Maintenance Systems. The class of nonmonotonic rule systems was introduced in Part I [the authors, 5th Ann. IEEE Symp. Logic in Comput. Sci., Philadelphia 1990, 79-94 (1990)]. Nonmonotonic rule systems provide an arena which brings out the common structure of these logics. They provide common syntax, semantics, algorithms and metatheorems for these subjects, and show that they are of equal generality.
    0 references
    0 references
    nonmonotonic logic
    0 references
    nonmonotonic rule systems
    0 references
    syntax
    0 references
    semantics
    0 references
    algorithms
    0 references
    metatheorems
    0 references
    0 references
    0 references
    0 references