Sciweavers

4737 search results - page 583 / 948
» The LOGIC negotiation model
Sort
View
DAM
2008
125views more  DAM 2008»
15 years 7 months ago
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
Eric SanJuan
AMC
2006
125views more  AMC 2006»
15 years 7 months ago
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
Seref Mirasyedioglu, Tolga Güyer
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 7 months ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron
AAMAS
2011
Springer
14 years 11 months ago
Declarative programming for agent applications
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...
John W. Lloyd, Kee Siong Ng
DAC
2004
ACM
16 years 8 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...