On the modelling and optimization of preferences in constraint-based temporal reasoning
From MaRDI portal
Publication:646549
DOI10.1016/J.ARTINT.2010.11.016zbMATH Open1225.68245OpenAlexW2070587810MaRDI QIDQ646549FDOQ646549
Authors: 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
Recommendations
- Principles and Practice of Constraint Programming – CP 2004
- Translation-based approaches for solving disjunctive temporal problems with preferences
- Solving disjunctive temporal problems with preferences using maximum satisfiability
- scientific article; zbMATH DE number 2086971
- Efficient solution techniques for disjunctive temporal reasoning problems
optimizationconstraint satisfactionbranch and boundtemporal reasoningpreferencesoverconstrained problems
Cites Work
- Handbook of constraint programming.
- Temporal constraint networks
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Computer Aided Verification
- Incompleteness and incomparability in preference aggregation: complexity results
- Efficient solution techniques for disjunctive temporal reasoning problems
- Semiring-based constraint satisfaction and optimization
- Semirings for constraint solving and programming.
- IJCAI '01: 17th international joint conference on artificial intelligence (2-volume \& CD set)
- On Solving Soft Temporal Constraints Using SAT Techniques
- Dealing with Incomplete Preferences in Soft Constraint Problems
- Backtracking algorithms for disjunctions of temporal constraints
- A logical approach to efficient Max-SAT solving
- Mechanizing Mathematical Reasoning
- Evaluating and improving modern variable and revision ordering strategies in CSPs
- Logic Programming
- Principles and Practice of Constraint Programming – CP 2004
Cited In (7)
- Solving disjunctive temporal problems with preferences using maximum satisfiability
- Translation-based approaches for solving disjunctive temporal problems with preferences
- On Solving Soft Temporal Constraints Using SAT Techniques
- Efficient solution techniques for disjunctive temporal reasoning problems
- Principles and Practice of Constraint Programming – CP 2004
- Temporal reasoning with layered preferences
- Title not available (Why is that?)
Uses Software
This page was built for publication: On the modelling and optimization of preferences in constraint-based temporal reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646549)
