Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
In this paper we deal with the problem of providing natural language front-ends to databases upon which an ontology layer has been added. Specifically, we are interested in expres...
Raffaella Bernardi, Diego Calvanese, Camilo Thorne
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...