Sciweavers

4370 search results - page 16 / 874
» Algebra of Logic Programming
Sort
View
LOGCOM
2010
85views more  LOGCOM 2010»
13 years 7 months ago
The Logic of Quasi-MV Algebras
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
Félix Bou, Francesco Paoli, Antonio Ledda, ...
ACTAC
2002
75views more  ACTAC 2002»
13 years 8 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
CADE
2005
Springer
14 years 9 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 26 days ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
LPNMR
1990
Springer
14 years 25 days ago
The meaning of Negative Premises in Transition System Specifications
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 ...
Roland N. Bol, Jan Friso Groote