منابع مشابه
Horn Clause Contraction Functions
In classical, AGM-style belief change, it is assumed that the underlying logic contains classical propositional logic. This is clearly a limiting assumption, particularly in Artificial Intelligence. Consequently there has been recent interest in studying belief change in approaches where the full expressivity of classical propositional logic is not obtained. In this paper we investigate belief ...
متن کاملHorn Clause Belief Change: Contraction Functions
The standard (AGM) approach to belief change assumes that the underlying logic is at least as strong as classical propositional logic. This paper investigates an account of belief change, specifically contraction, where the underlying logic is that governing Horn clauses. Thus this work sheds light on the theoretical underpinnings of belief change by weakening a fundamental assumption of the ar...
متن کاملHorn Clause Contraction Functions: Belief Set and Belief Base Approaches
Standard approachs to belief change assume that the underlying logic contains classical propositional logic. Recently there has been interest in investigating approaches to belief change, specifically contraction, in which the underlying logic is not as expressive as full propositional logic. In this paper we consider approaches to belief contraction in Horn knowledge bases. We develop two broa...
متن کاملSmallest Horn Clause Programs
The simplest non{trivial program pattern in logic programming is the following one : 8 < : p(fact) : p(left) p(right) : p(goal) : where fact, goal, left and right are arbitrary terms. Because the well known append program matches this pattern, we will denote such programs \append{like". In spite of their simple appearance, we prove in this paper that termination and satissability (i.e the exist...
متن کاملGeneralized Horn Clause Programs
This paper considers, in a general setting, an axiomatic basis for Horn clause logic programming. It characterizes a variety of \Horn-clause-like" computations, arising in contexts such as deductive databases, various abstract interpretations, and extensions to logic programming involving E-uniication, quantitative deduction, and inheritance, in terms of two simple operators , and discusses alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2013
ISSN: 1076-9757
DOI: 10.1613/jair.4031