827 search results - page 47 / 166 » Proof-Theoretic Soundness and Completeness |
AI
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. In this paper we focus on the problem of integrating knowledge bases expressed in a description logic. To this end, we propose three basic operations: union, intersection...
CL
2000
Springer
14 years 1 days ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
CL
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
PODS
1999
ACM
14 years 1 days ago
1999
ACM
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...
MFCS
1997
Springer
13 years 12 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...