Sciweavers

10 search results - page 2 / 2
» A Quantifier Scoping Algorithm without A Free Variable Const...
Sort
View
CSCLP
2008
Springer
13 years 6 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
JAR
2006
236views more  JAR 2006»
13 years 4 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
KI
2010
Springer
12 years 11 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer
ECCC
2006
145views more  ECCC 2006»
13 years 4 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
ICC
2007
IEEE
104views Communications» more  ICC 2007»
13 years 11 months ago
Multiplexing Video on Broadcast Channels via Convex Programs
— We propose a joint power- and rate-control scheme to broadcast a multiplicity of video sequences over a broadcast channel. The formulation is intended to be general in scope, w...
Raju Hormis, Elliot N. Linzer, Xiaodong Wang