Classification transfer for qualitative reasoning problems
暂无分享,去创建一个
[1] Dana,et al. JSL volume 88 issue 4 Cover and Front matter , 1983, The Journal of Symbolic Logic.
[2] Jochen Renz,et al. A Spatial Odyssey of the Interval Algebra: 1. Directed Intervals , 2001, IJCAI.
[3] Bernhard Nebel,et al. Computational Properties of Qualitative Spatial Reasoning: First Results , 1995, KI.
[4] Alfred Horn,et al. On sentences which are true of direct unions of algebras , 1951, Journal of Symbolic Logic.
[5] Anthony G. Cohn,et al. A Spatial Logic based on Regions and Connection , 1992, KR.
[6] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[7] Barnaby Martin,et al. Discrete Temporal Constraint Satisfaction Problems , 2018, J. ACM.
[8] Gérard Ligozat,et al. Reasoning about Cardinal Directions , 1998, J. Vis. Lang. Comput..
[9] Manuel Bodirsky,et al. A Fast Algorithm and Lower Bound for Temporal Reasoning , 2008, ArXiv.
[10] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .
[11] Luis Fariñas del Cerro,et al. Tractability Results in the Block Algebra , 2002, J. Log. Comput..
[12] Bernhard Nebel,et al. Qualitative Spatial Reasoning Using Constraint Calculi , 2007, Handbook of Spatial Logics.
[13] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2010, JACM.
[14] Henry A. Kautz,et al. Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.
[15] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[16] Manuel Bodirsky,et al. Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.
[17] Andrew U. Frank,et al. Qualitative Spatial Reasoning with Cardinal Directions , 1991, ÖGAI.
[18] Amitabha Mukerjee,et al. A Qualitative Model for Space , 1990, AAAI.
[19] P. Dangerfield. Logic , 1996, Aristotle and the Stoics.
[20] Michael Pinsker,et al. Schaefer's Theorem for Graphs , 2015, J. ACM.
[21] Jae Hee Lee,et al. A Survey of Qualitative Spatial and Temporal Calculi , 2016, ACM Comput. Surv..
[22] Dmitriy Zhuk,et al. A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[23] Peter Jeavons,et al. On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..
[24] Robin Hirsch,et al. Relation Algebras of Intervals , 1996, Artif. Intell..
[25] Andrei A. Bulatov,et al. A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[26] Peter Jonsson,et al. A Complete Classification of Tractability in RCC-5 , 1997, J. Artif. Intell. Res..
[27] Manuel Bodirsky,et al. RCC8 Is Polynomial on Networks of Bounded Treewidth , 2011, IJCAI.
[28] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[29] Omer Reingold,et al. Undirected connectivity in log-space , 2008, JACM.
[30] Bernhard Nebel,et al. Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.
[31] Peter Jeavons,et al. Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra , 2003, JACM.