1331 search results - page 184 / 267 » Description logic reasoning using the PTTP approach |
179
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
170
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
181
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
We introduce a declarative approach for a coherent composition of autonomous databases. For this we use ID-logic, a formalism that extends classical logic with inductive definitio...
152
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
152
click to vote
DLOG
2007
15 years 8 months ago
2007
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...