3658 search results - page 275 / 732 » The logic of proofs, semantically |
209
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...
230
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...
174
click to vote
BIRTHDAY
2005
Springer
16 years 9 days 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 ...
187
click to vote
JFPLC
1998
15 years 8 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...
179
click to vote
ENTCS
2000
15 years 6 months ago
2000
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...