Sciweavers

3658 search results - page 134 / 732
» The logic of proofs, semantically
Sort
View
FOSSACS
2006
Springer
14 years 2 months ago
Presenting Functors by Operations and Equations
We take the point of view that, if transition systems are coalgebras for a functor T, then an adequate logic for these transition systems should arise from the `Stone dual' L ...
Marcello M. Bonsangue, Alexander Kurz
CADE
1998
Springer
14 years 2 months ago
Extensional Higher-Order Resolution
Abstract. In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principl...
Christoph Benzmüller, Michael Kohlhase
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 9 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
ASP
2003
Springer
14 years 4 months ago
What's in a model? Epistemological analysis of Logic Programming
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. This is not quite so. This paper shows an...
Marc Denecker
LPNMR
2001
Springer
14 years 3 months ago
Multi-adjoint Logic Programming with Continuous Semantics
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...