On the modelling and optimization of preferences in constraint-based temporal reasoning

DOI10.1016/j.artint.2010.11.016zbMath1225.68245OpenAlexW2070587810MaRDI QIDQ646549

Michael D. Moffitt

Publication date: 17 November 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.11.016

zbMATH Keywords

optimizationbranch and boundpreferencestemporal reasoningconstraint satisfactionoverconstrained problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Translation-based approaches for solving disjunctive temporal problems with preferences

Uses Software

• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incompleteness and incomparability in preference aggregation: complexity results
• Efficient solution techniques for disjunctive temporal reasoning problems
• Temporal constraint networks
• Backtracking algorithms for disjunctions of temporal constraints
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Semirings for constraint solving and programming.
• A logical approach to efficient Max-SAT solving
• Dealing with Incomplete Preferences in Soft Constraint Problems
• On Solving Soft Temporal Constraints Using SAT Techniques
• Semiring-based constraint satisfaction and optimization
• Logic Programming
• Computer Aided Verification
• Mechanizing Mathematical Reasoning
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: On the modelling and optimization of preferences in constraint-based temporal reasoning