2500 search results - page 62 / 500 » Logical Semantics of Modularisation |
159
Voted
IAT
2009
IEEE
16 years 22 days 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...
218
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...
162
click to vote
AAAI
1994
15 years 7 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
177
click to vote
LICS
2005
IEEE
15 years 11 months 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...
256
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 ...