Sciweavers

73 search results - page 9 / 15
» Logical Logging to Extend Recovery to New Domains
Sort
View
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 7 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...
ASPLOS
2010
ACM
13 years 10 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...
AMAI
1999
Springer
13 years 7 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ECML
2007
Springer
14 years 1 months ago
Probabilistic Explanation Based Learning
Abstract. Explanation based learning produces generalized explanations from examples. These explanations are typically built in a deductive manner and they aim to capture the essen...
Angelika Kimmig, Luc De Raedt, Hannu Toivonen
LICS
2002
IEEE
14 years 9 days ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin