Sciweavers

624 search results - page 42 / 125
» Reasoning with Expressive Description Logics: Theory and Pra...
Sort
View
DLOG
2003
13 years 9 months ago
Complexity of Reasoning
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
Francesco M. Donini
EDBT
1990
ACM
108views Database» more  EDBT 1990»
13 years 11 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo
CADE
1997
Springer
13 years 11 months ago
Deciding Intuitionistic Propositional Logic via Translation into Classical Logic
Abstract. We present a technique that efficiently translates propositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary...
Daniel S. Korn, Christoph Kreitz
DLOG
2001
13 years 9 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat
TPHOL
2009
IEEE
14 years 2 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight