2500 search results - page 125 / 500 » Logical Semantics of Modularisation |
199
click to vote
JAPLL
2007
15 years 6 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
215
click to vote
DLOG
2011
14 years 10 months ago
2011
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
206
click to vote
FSTTCS
2005
Springer
15 years 12 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
163
click to vote
BIRTHDAY
2005
Springer
15 years 12 months ago
2005
Springer
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
176
click to vote
JFPLC
1998
15 years 7 months ago
1998
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...