- 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
Modelling and solving temporal reasoning as propositional satisfiability
Artificial Intelligence 172 (15):1752-1782 (2008)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
On the modelling and optimization of preferences in constraint-based temporal reasoning.Michael D. Moffitt - 2011 - Artificial Intelligence 175 (7-8):1390-1409.
On market-inspired approaches to propositional satisfiability.William E. Walsh, Makoto Yokoo, Katsutoshi Hirayama & Michael P. Wellman - 2003 - Artificial Intelligence 144 (1-2):125-156.
Propositional proof systems based on maximum satisfiability.Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, Antonio Morgado & Joao Marques-Silva - 2021 - Artificial Intelligence 300 (C):103552.
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs.Miroslaw Truszczyński - 2010 - Artificial Intelligence 174 (16-17):1285-1306.
Modelling student's problem solving.D. H. Sleeman & M. J. Smith - 1981 - Artificial Intelligence 16 (2):171-187.
Temporal belief logics for modelling distributed artificial intelligence systems.Michael Wooldridge - 1996 - In N. Jennings & G. O'Hare (eds.), Foundations of Distributed Artificial Intelligence. Wiley. pp. 269--286.
Search and Reasoning in problem solving.Herbert A. Simon - 1983 - Artificial Intelligence 21 (1-2):7-29.
Temporal scenario modelling and recognition based on possibilistic logic.Michel Grabisch - 2003 - Artificial Intelligence 148 (1-2):261-289.
Solving multi-granularity temporal constraint networks.Claudio Bettini, X. Sean Wang & Sushil Jajodia - 2002 - Artificial Intelligence 140 (1-2):107-152.
Constraint partitioning in penalty formulations for solving temporal planning problems.Benjamin W. Wah & Yixin Chen - 2006 - Artificial Intelligence 170 (3):187-231.
Analytics
Added to PP
2020-12-22
Downloads
8 (#1,344,496)
6 months
5 (#710,385)
2020-12-22
Downloads
8 (#1,344,496)
6 months
5 (#710,385)
Historical graph of downloads
Citations of this work
Qualitative constraint satisfaction problems: An extended framework with landmarks.Sanjiang Li, Weiming Liu & Shengsheng Wang - 2013 - Artificial Intelligence 201 (C):32-58.
Decomposition and tractability in qualitative spatial and temporal reasoning.Jinbo Huang, Jason Jingshi Li & Jochen Renz - 2013 - Artificial Intelligence 195 (C):140-164.
References found in this work
Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
Reasoning about qualitative temporal information.Peter van Beek - 1992 - Artificial Intelligence 58 (1-3):297-326.
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.
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-68866f4b87-x7cz5 uwo