Sciweavers

394 search results - page 16 / 79
» Logical operations and Kolmogorov complexity
Sort
View
ICLP
1997
Springer
14 years 26 days ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CSL
2009
Springer
14 years 18 days ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
JSAI
2007
Springer
14 years 2 months ago
Towards a Logical Reconstruction of CF-Induction
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
Yoshitaka Yamamoto, Oliver Ray, Katsumi Inoue
FOSSACS
2010
Springer
14 years 3 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
DLOG
2009
13 years 6 months ago
Reasoning About Typicality in ALC and EL
In this work we summarize our recent results on extending Description Logics for reasoning about prototypical properties and inheritance with exceptions. First, we focus our attent...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...