Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
402986 | Knowledge-Based Systems | 2011 | 13 Pages |
Abstract
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 situation. In this study, we extend order-sorted logic by introducing existential rigidity and many modalities. In the extended logic, sorted modal formulas are interpreted over the Cartesian product of sets of possible worlds. We present a new labeled tableau calculus to check the (un)satisfiability and validity of sorted modal formulas.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Ken Kaneiwa,