Towards an Efficient SAT Encoding for Temporal Reasoning
暂无分享,去创建一个
[1] KAMAL-ALDIN Ghiathi,et al. USING SATISFIABILITY IN TEMPORAL PLANNING , 2004 .
[2] Steven David Prestwich,et al. Local Search on SAT-encoded Colouring Problems , 2003, SAT.
[3] Henry A. Kautz,et al. Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.
[4] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[5] Bernhard Nebel,et al. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.
[6] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[7] Peter van Beek,et al. The Design and Experimental Analysis of Algorithms for Temporal Reasoning , 1995, J. Artif. Intell. Res..
[8] Alexander Reinefeld,et al. Effective Solution of Qualitative Interval Constraint Problems , 1992, Artif. Intell..
[9] Martin E. Dyer,et al. Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..
[10] Ron Shamir,et al. Complexity and algorithms for reasoning about time: a graph-theoretic approach , 1993, JACM.
[11] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[12] Peter van Beek,et al. Reasoning About Qualitative Temporal Information , 1990, Artif. Intell..
[13] Peter van Beek,et al. Exact and approximate reasoning about temporal relations 1 , 1990, Comput. Intell..
[14] Alan M. Frisch,et al. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings , 2001, Journal of Automated Reasoning.
[15] Michael J. Maher,et al. A Local Search Approach to Modelling and Solving Interval Algebra Problems , 2004, J. Log. Comput..
[16] Eugene C. Freuder. Synthesizing constraint expressions , 1978, CACM.
[17] Ian P. Gent. Arc Consistency in SAT , 2002, ECAI.
[18] Toby Walsh,et al. SAT v CSP , 2000, CP.
[19] Bart Selman,et al. Encoding Plans in Propositional Logic , 1996, KR.
[20] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[21] Bernhard Nebel,et al. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class , 1997, Constraints.
[22] Holger H. Hoos. SAT-Encodings, Search Space Structure, and Local Search Performance , 1999, IJCAI.