Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
A more expressive formulation of many sorted logic
Journal of Automated Reasoning
A many-sorted calculus based on resolution and paramodulation
A many-sorted calculus based on resolution and paramodulation
Computational aspects of an order-sorted logic with term declarations
Computational aspects of an order-sorted logic with term declarations
Attributive concept descriptions with complements
Artificial Intelligence
The substitutional framework for sorted deduction: fundamental results on hybrid reasoning
Artificial Intelligence - Special issue on knowledge representation
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
An order-sorted logic for knowledge representation systems
Artificial Intelligence
Feature-constraint logics for unification grammars
Journal of Logic Programming
An order-sorted resolution in theory and practice
Theoretical Computer Science - Special issue: theoretical computer science in Australia and New Zealand
Reasoning in description logics
Principles of knowledge representation
Clausal Form Logic: An Introduction to the Logic of Computer Reasoning
Clausal Form Logic: An Introduction to the Logic of Computer Reasoning
A scheme for integrating concrete domains into concept languages
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Resolution for label-based formulas in hierarchical representation
New Generation Computing
Order-sorted logic programming with predicate hierarchy
Artificial Intelligence
Logical aspects of events: quantification, sorts, composition and disjointness
AOW '05 Proceedings of the 2005 Australasian Ontology Workshop - Volume 58
A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
New Generation Computing
Discordance Detection in Regional Ordinance: Ontology-based Validation
Proceedings of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference
Inheritance of multiple identity conditions in order-sorted logic
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negations, called lexical negations in linguistics, are not explicitly prefixed by the negation connective. In this paper, we propose the notions of structured sorts, sort relations, and the contradiction in the sort-hierarchy. These notions specify the properties of these implicit negations and the classical negation, and thus, we can declare the exclusivity and the totality between two sorts, one of which is affirmative while the other is negative. We regard the negative affix as a strong negation operator, and the negative lexicon as an antonymous sort that is exclusive to its counterpart in the hierarchy. In order to infer from these negations, we integrate a structured sort constraint system into a clausal inference system.