Sciweavers

155 search results - page 7 / 31
» Symplectic Alternating Algebras
Sort
View
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 2 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
AAAI
1990
13 years 8 months ago
An Algebraic Approach to Conflict Resolution in Planning
This paper presents an algebra for conflict resolution in nonlinear planning. A set of conflicts in a plan is considered as a constraint network. Each node in the network represen...
Qiang Yang
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding 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
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 7 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
ER
2011
Springer
265views Database» more  ER 2011»
12 years 7 months ago
Modeling the Propagation of User Preferences
Abstract. User preferences are a fundamental ingredient of personalized database applications, in particular those in which the user context plays a key role. Given a set of prefer...
Paolo Ciaccia, Riccardo Torlone