3658 search results - page 231 / 732 » The logic of proofs, semantically |
159
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
182
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
128
click to vote
JUCS
2007
15 years 6 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
192
click to vote
RR
2009
Springer
16 years 1 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
199
click to vote
FLAIRS
2007
15 years 9 months ago
2007
This work addresses the issue of prioritized reasoning in the context of logic programming. The case of preference conditions involving atoms is considered and a refinement of th...