Sciweavers

1313 search results - page 171 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
SAC
2010
ACM
14 years 8 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
CSL
2008
Springer
14 years 11 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
SEMWEB
2009
Springer
15 years 4 months ago
An Algorithm for Learning with Probabilistic Description Logics
Probabilistic Description Logics are the basis of ontologies in the Semantic Web. Knowledge representation and reasoning for these logics have been extensively explored in the last...
José Eduardo Ochoa Luna, Fabio Gagliardi Co...
CPAIOR
2006
Springer
15 years 1 months ago
Event-Driven Probabilistic Constraint Programming
Real-life management decisions are usually made in uncertain environments, and decision support systems that ignore this uncertainty are unlikely to provide realistic guidance. We ...
Armagan Tarim, Brahim Hnich, Steven David Prestwic...
AICOM
2010
127views more  AICOM 2010»
14 years 10 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...