Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Abstract. This paper describes a web-based CBR application competing at the first Computer Cooking Contest at the ECCBR 2008. It describes the technical realisation of our system, ...
Alexandre Hanft, Norman Ihle, Kerstin Bach, R&eacu...
Abstract. In this short paper we describe the DFL hybrid knowledge base, that integrates descriptions with expressive object-oriented rules. The knowledge base manages a database o...