Sciweavers

283 search results - page 11 / 57
» Extracting Program Logics From Abstract Interpretations Defi...
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Verifying Properties of Infinite Sequences of Description Logic Actions
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
Franz Baader, Hongkai Liu, Anees ul Mehdi
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
PEPM
2009
ACM
14 years 4 months ago
Linear logical approximations
ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying ope...
Robert J. Simmons, Frank Pfenning
ACL
2012
11 years 10 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
CSL
2010
Springer
13 years 8 months ago
Automata vs. Logics on Data Words
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
Michael Benedikt, Clemens Ley, Gabriele Puppis