Solving Non-Linear Arithmetic Dejan Jovanovi´c1 and Leonardo de Moura2 1 2 New York University

First Page		Document Content
Date: 2014-06-27 12:47:14 Algebra Mathematics Polynomials Abstract algebra Computer algebra Polynomial Factorization of polynomials Constraint programming Resultant Constraint logic programming Polynomial ring		Solving Non-Linear Arithmetic Dejan Jovanovi´c1 and Leonardo de Moura2 1 2 New York University Add to Reading List Source URL: csl.sri.com Download Document from Source Website File Size: 867,59 KB Share Document on Facebook

	Theory and Practice of Logic Programming, Vol. 6, No. 5, pp, Programming Finite-Domain Constraint Propagators in Action Rules DocID: 1tOef - View Document
	Proceedings of CICLOPS 2009 9th International Colloquium on Implementation of Constraint and LOgic Programming Systems DocID: 1t8iI - View Document
	On the Robustness of Qualitative Distance- and Direction-Reasoning* Jung-Hong Hong Department of Surveying Engineering National Cheng-Kung University DocID: 1rqXQ - View Document
	CONTRIBUTED TALK ABSTRACTS 1.2 JAKUB BUL´IN Charles University in Prague Absorption in finitely related SD(∧) algebras has bounded arity The notion of absorbing subuniverse plays an important role in the recent devel DocID: 1rm3f - View Document
	AAAI Proceedings Template DocID: 1r9Ui - View Document