Sciweavers

1071 search results - page 121 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
PLDI
2011
ACM
14 years 22 days ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
CL
2000
Springer
15 years 2 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
ILP
2005
Springer
15 years 3 months ago
Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models
Abstract. Logical Bayesian Networks (LBNs) have recently been introduced as another language for knowledge based model construction of Bayesian networks, besides existing languages...
Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe...
ICLP
1997
Springer
15 years 2 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CADE
2008
Springer
15 years 10 months ago
Bit Inference
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
Nachum Dershowitz