1017 search results - page 99 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
121
click to vote
LICS
1995
IEEE
15 years 1 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
106
click to vote
ACMICEC
2005
ACM
15 years 3 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...
MIDDLEWARE
2007
Springer
15 years 3 months ago
2007
Springer
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
AGP
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
109
click to vote
EMSOFT
2006
Springer
15 years 1 months ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...