- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Abstracting soft constraints: Framework, properties, examples
Artificial Intelligence 139 (2):175-211 (2002)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Arc consistency for soft constraints.Martin Cooper & Thomas Schiex - 2004 - Artificial Intelligence 154 (1-2):199-227.
Properties of tree convex constraints.Yuanlin Zhang & Eugene C. Freuder - 2008 - Artificial Intelligence 172 (12-13):1605-1612.
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies.Mirco Gelain, Maria Silvia Pini, Francesca Rossi, K. Brent Venable & Toby Walsh - 2010 - Artificial Intelligence 174 (3-4):270-294.
Computational properties of argument systems satisfying graph-theoretic constraints.Paul E. Dunne - 2007 - Artificial Intelligence 171 (10-15):701-729.
An integrated framework for ought-to-be and ought-to-do constraints.P. D'Altan, J.-J. Ch Meyer & R. J. Wieringa - 1996 - Artificial Intelligence and Law 4 (2):77-111.
An integrated framework for ought-to-be and ought-to-do constraints.Piero D'Altan, John-Jules Ch Meyer & Roelf Johannes Wieringa - 1996 - Artificial Intelligence and Law 4 (2):77-111.
Stefano Franchi and Güven Güzeldere, eds., Mechanical Bodies, Computational Minds: Artificial Intelligence from Automata to Cyborgs Reviewed by.John Sutton - 2006 - Philosophy in Review 26 (6):414-416.
A general semi-structured formalism for computational argumentation: Definition, properties, and examples of application.Pietro Baroni, Massimiliano Giacomin & Beishui Liao - 2018 - Artificial Intelligence 257 (C):158-207.
An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information.Francesco Belardinelli, Angelo Ferrando & Vadim Malvone - 2023 - Artificial Intelligence 316 (C):103847.
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
Analytics
Added to PP
2020-12-22
Downloads
15 (#1,224,800)
6 months
5 (#1,025,536)
2020-12-22
Downloads
15 (#1,224,800)
6 months
5 (#1,025,536)
Historical graph of downloads
Author's Profile
Citations of this work
Abstraction for non-ground answer set programs.Zeynep G. Saribatur, Thomas Eiter & Peter Schüller - 2021 - Artificial Intelligence 300 (C):103563.
Fuzzy set and possibility theory-based methods in artificial intelligence.Didier Dubois & Henri Prade - 2003 - Artificial Intelligence 148 (1-2):1-9.
Introduction to the Special Volume on Reformulation.Thomas Ellman & Fausto Giunchiglia - 2005 - Artificial Intelligence 162 (1-2):3-5.
References found in this work
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
A theory of abstraction.Fausto Giunchiglia & Toby Walsh - 1992 - Artificial Intelligence 57 (2-3):323-389.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-sfdq8 dc2