Sciweavers

1391 search results - page 23 / 279
» Completeness of Neighbourhood Logic
Sort
View
IGPL
2010
156views more  IGPL 2010»
13 years 7 months ago
Fusion of sequent modal logic systems labelled with truth values
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...
João Rasga, Karina Roggia, Cristina Sernada...
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 9 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...
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 4 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg