444 search results - page 68 / 89 » Automated Logical Verification Based on Trace Abstractions |
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
MKM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...