Sciweavers

528 search results - page 29 / 106
» Transition Logic Revisited
Sort
View
128
Voted
VMCAI
2009
Springer
15 years 8 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
121
Voted
ML
2008
ACM
150views Machine Learning» more  ML 2008»
15 years 1 months ago
Learning probabilistic logic models from probabilistic examples
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, José Car...
DOLAP
2005
ACM
15 years 3 months ago
Mapping conceptual to logical models for ETL processes
Extraction-Transformation-Loading (ETL) tools are pieces of software responsible for the extraction of data from several sources, their cleansing, customization and insertion into...
Alkis Simitsis
120
Voted
IJCAI
2003
15 years 3 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
ECAI
2010
Springer
14 years 12 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum