756 search results - page 32 / 152 » Using Logic Programs to Reason about Infinite Sets |
105
click to vote
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
109
click to vote
AAAI
1996
14 years 11 months ago
1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
CADE
2010
Springer
14 years 10 months ago
2010
Springer
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
81
Voted
LPNMR
2007
Springer
15 years 3 months ago
2007
Springer
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...