Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Querying any information system requires the knowledge of some formal language, making it inaccessible to computer-na?ve potential users. We propose a new intuitive querying mecha...
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...