227 search results - page 25 / 46 » A Model Theory for Paraconsistent Logic Programming |
122
Voted
APLAS
2004
ACM
15 years 8 months ago
2004
ACM
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...
112
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
113
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
137
Voted
PLDI
2009
ACM
15 years 9 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
235
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...