903 search results - page 84 / 181 » Completeness Results for Memory Logics |
IJCAI
2007
13 years 10 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
FM
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...