Sciweavers

33 search results - page 4 / 7
» The Boolean Constraint Solver of SWI-Prolog (System Descript...
Sort
View
UIST
1997
ACM
15 years 2 months ago
Solving Linear Arithmetic Constraints for User Interface Applications
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring th...
Alan Borning, Kim Marriott, Peter J. Stuckey, Yi X...
CADE
2005
Springer
15 years 11 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
SMA
2006
ACM
107views Solid Modeling» more  SMA 2006»
15 years 4 months ago
Solving topological constraints for declarative families of objects
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
Hilderick A. van der Meiden, Willem F. Bronsvoort
AAAI
1990
14 years 11 months ago
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...
Johan de Kleer
AIPS
1994
14 years 12 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu