191 search results - page 37 / 39 » Propositional theories are strongly equivalent to logic prog... |
MLQ
2007
14 years 11 months ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
CMOT
1998
14 years 11 months ago
1998
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
126
click to vote
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
202
click to vote
POPL
2004
ACM
16 years 21 hour ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
103
click to vote
CADE
2005
Springer
16 years 20 hour ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...