92 search results - page 6 / 19 » Description Logics with Concrete Domains and Functional Depe... |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
ICDT
2003
ACM
14 years 24 days ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
CADE
2008
Springer
13 years 9 months ago
2008
Springer
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
LFCS
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
ACMICEC
2005
ACM
14 years 1 months ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...