Results 1  10
of
1,153,685
Abduction of Linear Arithmetic Constraints
 Proc. International Conference on Logic Programming, LNCS 3668
, 2005
"... Abstract. Abduction is usually carried out on partiallydefined predicates. In this paper we investigate abduction applied to fullydefined predicates, specifically linear arithmetic constraints over the real numbers. Abduction in this context has application to query answering using views and type ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. Abduction is usually carried out on partiallydefined predicates. In this paper we investigate abduction applied to fullydefined predicates, specifically linear arithmetic constraints over the real numbers. Abduction in this context has application to query answering using views and type
Solving linear arithmetic constraints
 SRI International, Computer Science Laboratory
, 2004
"... Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majority of proof obligations that arise in embedded applications of theorem proving such as extended typechecking, software and hardware verification, and compiler optimization. Such constraints involve the ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majority of proof obligations that arise in embedded applications of theorem proving such as extended typechecking, software and hardware verification, and compiler optimization. Such constraints involve
On the Construction of Automata from Linear Arithmetic Constraints
 Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science
, 2000
"... This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructed allows a lineartime determinization procedure to be used. Furthermore, it shows through theoretical ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructed allows a lineartime determinization procedure to be used. Furthermore, it shows through theoretical
Validity Checking for Finite Automata over Linear Arithmetic Constraints
"... Abstract In this paper, we introduce a new validity checking problem over linear arithmetic constraints and present a decision procedure for the problem. Instead of considering the validity of any particular linear arithmetic constraint, we consider the following problem: Given a finite automaton ac ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract In this paper, we introduce a new validity checking problem over linear arithmetic constraints and present a decision procedure for the problem. Instead of considering the validity of any particular linear arithmetic constraint, we consider the following problem: Given a finite automaton
The Cassowary Linear Arithmetic Constraint Solving Algorithm: Interface and Implementation
 ACM TRANSACTIONS ON COMPUTER HUMAN INTERACTION
, 1998
"... 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 that a pane occupy the leftmost 1/3 of a window, or preferring that an object be contained within a rectangle if possibl ..."
Abstract

Cited by 115 (10 self)
 Add to MetaCart
#ciently. This informal technical report describes the latest version of the Cassowary algorithm. It is derived from the paper "Solving Linear Arithmetic Constraints for User Interface Applications" by Alan Borning, Kim Marriott, Peter Stuckey, and Yi Xiao [7], published in the UIST'97 Proceedings
Subsumption and Indexing in Constraint Query Languages with Linear Arithmetic Constraints
 Annals of Mathematics and Artificial Intelligence
, 1993
"... Bottomup evaluation of a programquery pair in a constraint query language (CQL) starts with the facts in the database and repeatedly applies the rules of the program, in iterations, to compute new facts, until we have reached a fixpoint. Checking if a fixpoint has been reached amounts to checking ..."
Abstract

Cited by 37 (1 self)
 Add to MetaCart
arithmetic constraints is coNP complete, and present a deterministic algorithm, based on the divide and conquer strategy, for this problem. We also identify polynomialtime sufficient conditions for subsumption and nonsubsumption in CQLs with linear arithmetic constraints. We adapt indexing strategies from
Solving linear arithmetic constraints for user interface applications: Algorithm details
, 1997
"... 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 that a pane occupy the leftmost 1/3 of a window, or preferring that an object be contained within a rectangle if possible. ..."
Abstract

Cited by 71 (17 self)
 Add to MetaCart
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 that a pane occupy the leftmost 1/3 of a window, or preferring that an object be contained within a rectangle if possible
Cooperative Solvers and Global Constraints: The Case of Linear Arithmetic Constraints
 Constraints, Proceedings of ILPS' 95 Workshop
, 1995
"... For many combinatorial problems, it is often useful to use specialized OR algorithms that allow to solve a subproblem or a simplified version of the problem. Among these, Linear Programming algorithms, and most importantly the Simplex, are quite efficient and widely used. Many applications using ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
using Constraint Programming can take benefit from using such algorithms. It is therefore very useful to integrate Linear Programming algorithms with the propagationbased algorithms found in Constraint Programming, as soon as care is taken about the communication between both kinds of algorithms
Efficient solving of large nonlinear arithmetic constraint systems with complex boolean structure
 Journal on Satisfiability, Boolean Modeling and Computation
, 2007
"... In order to facilitate automated reasoning about large Boolean combinations of nonlinear arithmetic constraints involving transcendental functions, we provide a tight integration of recent SAT solving techniques with intervalbased arithmetic constraint solving. Our approach deviates substantially f ..."
Abstract

Cited by 85 (11 self)
 Add to MetaCart
performance gains recently achieved in propositional SAT solving carry over smoothly to the rich domain of nonlinear arithmetic constraints. As a consequence, our approach is able to handle large constraint systems with extremely complex Boolean structure, involving Boolean combinations of multiple thousand
Results 1  10
of
1,153,685