Event, Property, and Hierarchy in Order-Sorted Logic
نویسندگان
چکیده
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could construct a logic that includes both predicates and terms as classes in the hierarchies, it would be very useful for connecting general knowledge to specic knowledge. Although there are actually logics that are equipped with such a predicate hierarchy, they are built by logical implication and they cause the problem of predicate unication between dierent argument structures. In this paper, we present a logic language with a class hierarchy of predicates, where in the unication of predicates we devise a mechanism for deriving superordinate predicates in the hierarchy and for quantifying supplementary arguments. The arguments are quan-tied dierently, depending on whether a predicate is interpreted as an occurrence of an event or a universal property. T h us, we include the distinction between events and properties in predicates and present a logic language that can exibly relate predicates with dierent argument structures. We formalize the logic language both by s y n tax and semantics, and develop the inference system.
منابع مشابه
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to useful expressions and inference methods for structural knowledge that ordinary first-order logic lacks. Nitta et al. pointed out that for legal reasoning a sort-hierarchy (or a sorted term) is not sufficient to describ...
متن کاملLogical Aspects of Events: Quantification, Sorts, Composition and Disjointness
An event, as opposed to an atemporal property, has its own time and location and occurs once. Although the notion of events has been found in researches on ontology, logic, linguistics, artificial intelligence and deductive databases, the different approaches to this notion do not seem to capture the various logical aspects of events. This paper proposes an event logic with expressions such as ...
متن کاملOntological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non-sortal). This ontological analysis is an essential notion to deal with properties (or sorts) of objects in knowledge representation and reasoning. In this paper, we propose an extension of an order-sorted logic with th...
متن کاملThe completeness of logic programming with sort predicates
An order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e. a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted lo...
متن کاملExistential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (called sort-hierarchy). However, this logic cannot represent more complex sorted expressions when they are true in any possible world (as rigid) or some possible worlds (as modality) such as time, space, belief, or situ...
متن کامل