Sciweavers

40 search results - page 7 / 8
» Tractable Interval Temporal Propositional and Description Lo...
Sort
View
CADE
2002
Springer
15 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
LOGCOM
2002
142views more  LOGCOM 2002»
14 years 10 months ago
Two Logical Theories of Plan Recognition
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
Wayne Wobcke
IJCAI
1989
14 years 11 months ago
Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds
Mechanical systems, of the kinds which are of interest for qualitative reasoning, are characterized by a set of real-valued parameters, each of which is a piecewise continuous fun...
Erik Sandewall
ICSE
1997
IEEE-ACM
15 years 2 months ago
Analyzing Partially-Implemented Real-Time Systems
—Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, ...
George S. Avrunin, James C. Corbett, Laura K. Dill...
SEMWEB
2010
Springer
14 years 8 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...