Sciweavers

2145 search results - page 260 / 429
» Lax Logical Relations
Sort
View
ECAI
2000
Springer
14 years 14 days ago
Explaining ALC Subsumption
Knowledge representation systems, including ones based on Description Logics (DLs), use explanation facilities to, among others, debug knowledge bases. Until now, such facilities w...
Alexander Borgida, Enrico Franconi, Ian Horrocks
PODS
1999
ACM
153views Database» more  PODS 1999»
14 years 13 days ago
Consistent Query Answers in Inconsistent Databases
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...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
LICS
1999
IEEE
14 years 12 days ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
PEPM
1993
ACM
14 years 6 days ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 12 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz