352 search results - page 64 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
151
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
126
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
134
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
121
click to vote
LPNMR
1990
Springer
15 years 8 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
141
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Nowadays enterprises request information technologies that leverage structured and unstructured information for providing a single integrated view of business problems in...