Sciweavers

400 search results - page 61 / 80
» Backtracking
Sort
View
AMAI
2000
Springer
15 years 10 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva
CP
1995
Springer
15 years 10 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
ICTAI
1997
IEEE
15 years 10 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
ICLP
1995
Springer
15 years 10 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
VLDB
1995
ACM
103views Database» more  VLDB 1995»
15 years 10 months ago
Querying Shapes of Histories
We present a shape definition language, called SDC, for retrieving objects based on shapes contained in the histories associated with these objects. It is a small, yet powerful, l...
Rakesh Agrawal, Giuseppe Psaila, Edward L. Wimmers...