A logical semantics for hypothetical rulebases with deletion
نویسندگان
چکیده
منابع مشابه
A Logical Semantics for Hypothetical Rulebases with Deletion
This paper addresses a limitationof most deductive database systems: they cannot reason hypothetically. Although they reason eeectively about the world as it is, they are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. To address this limitation, we have developed a logic-programming language in which users can create...
متن کاملLogical Semantics for Stability
Type assignment systems for λ-calculus based on intersection types are a general framework for building models of λ-calculus (known as filter-models) which are useful tools for reasoning in a finitary way about the denotational intepretation of terms. Indeed the denotation of a term is the set of types derivable for it and a type is a “finite piece” of information on such a denotation. This app...
متن کاملLogical Semantics for CafeOBJ
This paper presents the semantics of CafeOBJ system and language. CafeOBJ is a succesor of the famous algebraic specification and programming language OBJ but adding several new primitive paradigms to the traditional OBJ language, such as rewriting logic, and behavioural concurrent specification. We do not address here the detalied mathematical aspects of CafeOBJ semantics (which sometimes coul...
متن کاملHypothetical Reasoning with Well Founded Semantics
Well Founded Semantics is shown adequate to capture hypothetical reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the Well Founded model may be accepted as a partially definite view of the world, and the other extended stable models as alternative extended consistent views of the world. The original contributions of this paper ar...
متن کاملA Logical Semantics for Nonmonotonic Sorts
Suppose we have a feature system, and we wish to add default values in a well-deened way. We might start with Kasper-Rounds logic, and use Reiter's example to form it into a default logic. Giving a node a default value would be equivalent to saying \if it is consistent for this node to have that value, then it does." Then we could use default theories to describe feature structures. The particu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1997
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00093-3