294 search results - page 33 / 59 » Relation between Semantic Completeness and Syntax Completene... |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
ACTA
1998
13 years 7 months ago
1998
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
Prior work has shown that semantic email processes (SEPs) can be an effective tool for automating emailmediated tasks that are currently performed manually in a tedious, time-cons...
ATAL
2005
Springer
14 years 1 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...