A mechanical solution of Schubert's steamroller by many-sorted resolution
Artificial Intelligence
Journal of the ACM (JACM)
Proceedings of the workshop on Sorts and types in artificial intelligence
The substitutional framework for sorted deduction: fundamental results on hybrid reasoning
Artificial Intelligence - Special issue on knowledge representation
An order-sorted logic for knowledge representation systems
Artificial Intelligence
An order-sorted resolution in theory and practice
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
First-order modal logic
Supporting ontological analysis of taxonomic relationships
Data & Knowledge Engineering - ER2000
Order-sorted logic programming with predicate hierarchy
Artificial Intelligence
Towards OntoClean 2.0: A framework for rigidity
Applied Ontology
Relating Cognitive Process Models to Behavioural Models of Agents
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Distributed reasoning with ontologies and rules in order-sorted logic programming
Web Semantics: Science, Services and Agents on the World Wide Web
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
ISWC '09 Proceedings of the 8th International Semantic Web Conference
An order-sorted quantified modal logic for meta-ontology
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Hi-index | 0.00 |
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.