756 search results - page 55 / 152 » Using Logic Programs to Reason about Infinite Sets |
KR
2004
Springer
15 years 3 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
ICLP
1991
Springer
15 years 1 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
JAPLL
2007
14 years 9 months ago
2007
We propose a novel method of determining the appropriateness of an answer to a question through a proof of logical relevance rather than a logical proof of truth. We define logic...
88
Voted
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
103
click to vote
MSCS
2006
14 years 9 months ago
2006
We present a dynamic logic for reasoning about information flow in quantum programs. In particular, we give a finitary syntax and a relational semantics for a Logic of Quantum Pro...