Sciweavers

1071 search results - page 130 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
CSL
2010
Springer
14 years 11 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
ECAI
2006
Springer
15 years 1 months ago
Logic Programs with Multiple Chances
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
Francesco Buccafurri, Gianluca Caminiti, Domenico ...
CSL
2007
Springer
15 years 4 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
DLOG
2011
14 years 1 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...
AIML
2006
14 years 11 months ago
Dynamic topological logics over spaces with continuous functions
Dynamic topological logics are combinations of topological and temporal modal logics that are used for reasoning about dynamical systems consisting of a topological space and a con...
Boris Konev, Roman Kontchakov, Frank Wolter, Micha...