SearchSkip to Search Results
- 1AGM postulates
- 1Autoepistemic reasoning
- 1Branch-and-bound algorithms
- 1Gelder's alternating fixpoint theory
- 1Knowledge base revision
Technical report TR05-05. A lookahead branch-and-bound 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
Technical report TR92-18. 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...
Technical report TR92-17. 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...
Technical report TR92-16. Recent proposals for semantics of default theories are all based on some types of weaker notion of extensions. This is typified in the well-founded semantics and the extension class semantics for default theories. Although these semantics solve the no-extension problem...