Search
Skip to Search Results 1AGM postulates
 1Autoepistemic reasoning
 1Branchandbound algorithms
 1Circumscription
 1Gelder's alternating fixpoint theory
 1Knowledge base revision

2005
Wu, Gang, Lin, Guohui, You, JiaHuai
Technical report TR0505. A lookahead branchandbound algorithm is proposed for solving the Maximum Quartet Consistency Problem where the input is a complete set of quartets on the taxa and the goal is to construct a phylogeny which satisfies the maximum number of given quartets. Such a...

Autoepistemic Circumscription and Logic Programming
1992
Technical report TR9218. We propose a framework of autoepistemic reasoning in which the underlying semantics is determined by the choice of a nonmonotonic inference mechanism and by specifying a belief constraint. While the latter makes the approach flexible in meeting possibly different...

1992
Technical report TR9217. The AGM postulates for knowledge base revision are a set of rationality postulates that revision operations on knowledge systems should satisfy. Defining an appropriate semantics for belief revision that satisfies all of the postulates has been considered a challenging...

1992
Technical report TR9216. Recent proposals for semantics of default theories are all based on some types of weaker notion of extensions. This is typified in the wellfounded semantics and the extension class semantics for default theories. Although these semantics solve the noextension problem...