Sciweavers

3047 search results - page 44 / 610
» On the Meaning of Logical Completeness
Sort
View
JOLLI
2008
98views more  JOLLI 2008»
13 years 8 months ago
Meaning and Dialogue Coherence: A Proof-theoretic Investigation
Abstract. This paper presents a novel proof-theoretic account of dialogue coherfocuses on an abstract class of cooperative information-oriented dialogues and describes how their st...
Paul Piwek
CGO
2008
IEEE
14 years 3 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
EPIA
2001
Springer
14 years 1 months ago
A Procedural Semantics for Multi-adjoint Logic Programming
Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connect...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
ENTCS
2007
158views more  ENTCS 2007»
13 years 8 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 3 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...