3658 search results - page 198 / 732 » The logic of proofs, semantically |
168
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
226
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
187
Voted
LICS
2005
IEEE
16 years 6 days ago
2005
IEEE
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
269
click to vote
LMCS
2006
15 years 6 months ago
2006
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps ...
168
click to vote
AAAI
1993
15 years 8 months ago
1993
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...