Sciweavers

2302 search results - page 152 / 461
» Basic Description Logics
Sort
View
JANCL
2006
100views more  JANCL 2006»
15 years 4 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
DLOG
2001
15 years 5 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
TPHOL
2009
IEEE
15 years 11 months ago
Types, Maps and Separation Logic
Abstract. This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe ract, generic Isabelle/HOL framework ...
Rafal Kolanski, Gerwin Klein
ISMVL
1999
IEEE
90views Hardware» more  ISMVL 1999»
15 years 8 months ago
Transformations between Signed and Classical Clause Logic
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 4 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...