Sciweavers

330 search results - page 33 / 66
» Algorithms for Propositional Model Counting
Sort
View
FOSSACS
2005
Springer
15 years 3 months ago
From Separation Logic to First-Order Logic
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
Cristiano Calcagno, Philippa Gardner, Matthew Hagu...
ICDT
2009
ACM
128views Database» more  ICDT 2009»
15 years 10 months ago
Efficient asymmetric inclusion between regular expression types
The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs wi...
Dario Colazzo, Giorgio Ghelli, Carlo Sartiani
98
Voted
CORR
1998
Springer
126views Education» more  CORR 1998»
14 years 9 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
111
Voted
CADE
2007
Springer
15 years 9 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CAV
2009
Springer
239views Hardware» more  CAV 2009»
15 years 1 months ago
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
tic modalities for correctness [16]. The release described in this abstract is a complete rebuild of a preliminary experimental checker [14]. The model input language includes vari...
Alessio Lomuscio, Hongyang Qu, Franco Raimondi