Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Login: A logic programming language with built-in inheritance
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Fixpoint iteration with subsumption in deductive databases
Journal of Intelligent Information Systems - Special issue: deductive and object-oriented databases
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Knowledge representation: logical, philosophical and computational foundations
Knowledge representation: logical, philosophical and computational foundations
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
IEEE Transactions on Knowledge and Data Engineering
Description Logics in Data Management
IEEE Transactions on Knowledge and Data Engineering
Capture, Integration, and Analysis of Digital System Requirements with Conceptual Graphs
IEEE Transactions on Knowledge and Data Engineering
Polynomial Algorithms for Projection and Matching
Proceedings of the 7th Annual Workshop on Conceptual Structures: Theory and Implementation
Characterization and Algorithmic Recognition of Canonical Conceptual Graphs
ICCS '93 Proceedings on Conceptual Graphs for Knowledge Representation
Inference Systems for Conceptual Graph Programs
ICCS '94 Proceedings of the Second International Conference on Conceptual Structures: Current Practices
A Direct Proof Procedure for Definite Conceptual Graph Programs
ICCS '95 Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory
Declarative Program Theory with Implicit Information
PRICAI '96 Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
An efficient easily adaptable system for interpreting natural language queries
Computational Linguistics
Computational Linguistics
IEICE - Transactions on Information and Systems
| Hi-index | 0.00 |
In the presence of taxonomic information, there often exists implicit implication among atoms in an interpretation domain. A general framework is proposed for the discussion of an appropriate semantics for declarative programs with respect to such implicit implication. It is first assumed that the implicit implication can be predetermined and represented by a preorder on the interpretation domain. Under the consequent constraint that every interpretation must conform to the implicit implication, an appropriate model-theoretic semantics as well as its corresponding fixpoint semantics for declarative programs is described. Based on Köstler et al.'s foundation of fixpoint with subsumption, it is shown that, if the implicit-implication relation is, in addition, assumed to be a partial order, then the meaning of a program can be determined more efficiently by application of an immediate-consequence operator which involves only reduced representations, basically consisting only of their maximal elements, of subsets of the interpretation domain.