247 search results - page 35 / 50 » A Computational Structure for the Propositional Calculus |
IJCAI
2007
13 years 8 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,...
ESWS
2007
Springer
13 years 11 months ago
2007
Springer
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
In network applications it is crucial to have a mechanism to guarantee that communications evolve correctly according to the agreed protocol. Session types offer a method for abstr...