2722 search results - page 389 / 545 » Automating Language Evolution |
229
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
136
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
128
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
127
Voted
CADE
2006
Springer
16 years 4 months ago
2006
Springer
This is a system description of the Description Logic reasoner FaCT++. The reasoner implements a tableaux decision procedure for the well known SHOIQ description logic, with additi...
116
Voted
CADE
2004
Springer
16 years 4 months ago
2004
Springer
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...