Search
Skip to Search Results- 2Autoepistemic logic
- 2Circumscription
- 2Nonmonotonic reasoning
- 1AGM postulates
- 1Autoepistemic reasoning
- 1Branch-and-bound algorithms
-
2005
Wu, Gang, Lin, Guohui, You, Jia-Huai
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
1992
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...
-
1992
Ghose, Aditya, Geobel, Randy, Yuan, Li-Yan
Technical report TR92-09. In many database applications, designers can easily provide at least some information about the relative importance of the information to be stored and manipulated. While of potentially high value, the ordering information is typically only partial. Here we address the...
-
1992
Technical report TR92-15. In this paper we propose the minimal well-founded semantics for logic programs with negation based on the fixpoint of the double Gelfond-Lifschitz transformation which overcomes the existing problems associated with the stable, the well-founded, and the stable class...
-
1992
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...
-
1992
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...