Sciweavers

26 search results - page 3 / 6
» Closed and Logical Relations for Over- and Under-Approximati...
Sort
View
ICLP
2009
Springer
14 years 6 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
LICS
2009
IEEE
14 years 11 days ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
DIAGRAMS
2006
Springer
13 years 9 months ago
The Mathematics of Boundaries: A Beginning
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...
William Bricken
LATIN
2004
Springer
13 years 11 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
PTS
2008
109views Hardware» more  PTS 2008»
13 years 7 months ago
Runtime Verification of C Programs
We present in this paper a framework, RMOR, for monitoring the execution of C programs against state machines, expressed in a textual (nongraphical) format in files separate from t...
Klaus Havelund