81 search results - page 4 / 17 » Extending Homeomorphic Embedding in the Context of Logic Pro... |
CSL
2002
Springer
13 years 5 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
JELIA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abduc...
ICLP
2009
Springer
14 years 6 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
CONCUR
2005
Springer
13 years 11 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...