Separating Knowledge from Computation An FO( ) Knowledge Base System and its Model Expansion Inference
暂无分享,去创建一个
[1] Joost Vennekens,et al. A logical framework for configuration software , 2009, PPDP '09.
[2] Yuliya Lierler,et al. Integration Schemas for Constraint Answer Set Programming: a Case Study , 2013, Theory Pract. Log. Program..
[3] Peter J. Stuckey,et al. MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.
[4] Johan Wittocx,et al. Towards Computing Revised Models for FO Theories , 2009, INAP.
[5] Johan Wittocx,et al. Finite domain and symbolic inference methods for extensions of first-order logic , 2010, AI Commun..
[6] Nikolay Pelov,et al. Semantics of logic programs with aggregates , 2004 .
[7] Martin Gebser,et al. Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..
[8] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..
[9] Giovambattista Ianni,et al. The third open answer set programming competition , 2012, Theory and Practice of Logic Programming.
[10] Wolfgang Faber,et al. The Intelligent Grounder of DLV , 2012, Correct Reasoning.
[11] Mutsunori Banbara,et al. Compiling finite linear CSP into SAT , 2006, Constraints.
[12] Geoff Sutcliffe. The 6th IJCAR automated theorem proving system competition - CASC-J6 , 2013, AI Commun..
[13] W. W. Armstrong,et al. Dependency Structures of Data Base Relationships , 1974, IFIP Congress.
[14] Peter J. Stuckey,et al. Stable model semantics for founded bounds , 2013, Theory Pract. Log. Program..
[15] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[16] Roberto Ierusalimschy,et al. Lua—An Extensible Extension Language , 1996 .
[17] Wolfgang Faber,et al. The DLV system for knowledge representation and reasoning , 2002, TOCL.
[18] Maurice Bruynooghe,et al. Analyzing manuscript traditions using constraint-based data mining , 2012 .
[19] Mihai Albu,et al. Testing methods on an artificially created textual tradition , 2006 .
[20] MARCELLO BALDUCCINI. ASP with non-herbrand partial functions: a language and system for practical use , 2013, Theory Pract. Log. Program..
[21] Geoff Sutcliffe. The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.
[22] Marcello Balduccini,et al. Industrial-Size Scheduling with ASP+CP , 2011, LPNMR.
[23] Igor L. Markov,et al. Efficient symmetry breaking for Boolean satisfiability , 2003, IEEE Transactions on Computers.
[24] Joohyung Lee,et al. Stable Models of Formulas with Intensional Functions , 2012, KR.
[25] Ilkka Niemelä,et al. Answer Set Programming via Mixed Integer Programming , 2012, KR.
[26] Martin Gebser,et al. Advances in gringo Series 3 , 2011, LPNMR.
[27] Nikolaj Bjørner,et al. Satisfiability modulo theories , 2011, Commun. ACM.
[28] Christoph Weidenbach,et al. SPASS Version 3.5 , 2009, CADE.
[29] Ian P. Gent,et al. Short and Long Supports for Constraint Propagation , 2013, J. Artif. Intell. Res..
[30] Bart Demoen,et al. A Novel Approach For Detecting Symmetries in CSP Models , 2008, CPAIOR.
[31] S. Timpanaro,et al. The genesis of Lachmann's method , 2005 .
[32] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[33] Joost Vennekens,et al. Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic , 2008, ICLP.
[34] Maurice Bruynooghe,et al. Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..
[35] Luc De Raedt,et al. On the implementation of the probabilistic logic programming language ProbLog , 2010, Theory and Practice of Logic Programming.
[36] Marc Denecker,et al. Model Expansion in the Presence of Function Symbols Using Constraint Programming , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.
[37] Roberto Bruttomesso,et al. A Lazy and Layered SMT($\mathcal{BV}$) Solver for Hard Industrial Verification Problems , 2007, CAV.
[38] Johan Wittocx,et al. The IDP system , 2010 .
[39] Geoff Sutcliffe. The CADE-23 Automated Theorem Proving System Competition - CASC-23 , 2012, AI Commun..
[40] Pedro M. Domingos,et al. Memory-Efficient Inference in Relational Domains , 2006, AAAI.
[41] David Scott Warren,et al. Tabled evaluation with delaying for general logic programs , 1996, JACM.
[42] Raymond Reiter,et al. Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.
[43] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[44] Torsten Schaub,et al. Unsatisfiability-based optimization in clasp , 2012, ICLP.
[45] Peter J. Stuckey,et al. Lazy Model Expansion by Incremental Grounding , 2012, ICLP.
[46] V. Lifschitz,et al. The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.
[47] Caroline Macé,et al. Beyond the tree of texts: Building an empirical model of scribal variation through graph analysis of texts and stemmata , 2013, Lit. Linguistic Comput..
[48] Murray Shanahan. Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .
[49] Emina Torlak,et al. Kodkod: A Relational Model Finder , 2007, TACAS.
[50] Peter Schneider-Kamp,et al. Optimal Base Encodings for Pseudo-Boolean Constraints , 2010, TACAS.
[51] John Martin,et al. A History of Satisfiability , 2009, Handbook of Satisfiability.
[52] Tuomas Heikkilä,et al. Evaluating methods for computer-assisted stemmatology using artificial benchmark data sets , 2009, Lit. Linguistic Comput..
[53] Andrei Voronkov,et al. First-Order Theorem Proving and Vampire , 2013, CAV.
[54] Michael Codish,et al. Compiling finite domain constraints to SAT with BEE* , 2012, Theory and Practice of Logic Programming.
[55] Danny De Schreye,et al. Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs , 1993, International Conference on Logic Programming and Non-Monotonic Reasoning.
[56] Greg Nelson,et al. Fast Decision Procedures Based on Congruence Closure , 1980, JACM.
[57] Eugenia Ternovska,et al. Reducing Inductive Definitions to Propositional Satisfiability , 2005, ICLP.
[58] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[59] David G. Mitchell,et al. Lifted Unit Propagation for Effective Grounding , 2011, ArXiv.
[60] Peter J. Stuckey,et al. MiniZinc with Functions , 2013, CPAIOR.
[61] Michael Thielscher,et al. Representing the Knowledge of a Robot , 2000, KR.
[62] Leonardo Mendonça de Moura,et al. Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories , 2009, CAV.
[63] Felix Sheng-Ho Chang,et al. Finding Minimal Unsatisfiable Cores of Declarative Specifications , 2008, FM.
[64] David Detlefs,et al. Simplify: a theorem prover for program checking , 2005, JACM.
[65] Gerda Janssens,et al. IDP3: Combining symbolic and ground reasoning for model generation , 2013 .
[66] Thai Son Hoang,et al. Rodin: an open toolset for modelling and reasoning in Event-B , 2010, International Journal on Software Tools for Technology Transfer.
[67] Nikolaj Bjørner,et al. Open-World Logic Programs: A New Foundation for Formal Specifications , 2013 .
[68] Guy Van den Broeck,et al. An exercise with statistical relational learning systems , 2009 .
[69] Miroslaw Truszczynski,et al. The Second Answer Set Programming Competition , 2009, LPNMR.
[70] Maurice Bruynooghe,et al. Detection and exploitation of functional dependencies for model generation , 2013, Theory and Practice of Logic Programming.
[71] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[72] Michael Gelfond,et al. Integrating answer set programming and constraint logic programming , 2008, Annals of Mathematics and Artificial Intelligence.
[73] Eugenia Ternovska,et al. Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions , 2007, IJCAI.
[74] Hans Tompits,et al. A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.
[75] Miroslaw Truszczynski,et al. Answer set programming at a glance , 2011, Commun. ACM.
[76] Martin Gebser,et al. Constraint Answer Set Solving , 2009, ICLP.
[77] Daniel Jackson,et al. Alloy: a lightweight object modelling notation , 2002, TSEM.
[78] Tomi Janhunen,et al. Representing Normal Programs with Clauses , 2004, ECAI.
[79] David G. Mitchell,et al. Enfragmo: A System for Modelling and Solving Search Problems with Logic , 2012, LPAR.
[80] Luís Moniz Pereira,et al. Towards Practical Tabled Abduction in Logic Programs , 2013, EPIA.
[81] Ping Hou,et al. FO(FD): Extending classical logic with rule-based fixpoint definitions , 2010, Theory and Practice of Logic Programming.
[82] Maurice Bruynooghe,et al. Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3 , 2013, Theory and Practice of Logic Programming.
[83] Erwin Pesch,et al. Analysis, modeling and solution of the concrete delivery problem , 2009, Eur. J. Oper. Res..
[84] Marc Denecker,et al. The Well-Founded Semantics Is the Principle of Inductive Definition , 1998, JELIA.
[85] Martin Gebser,et al. On the Input Language of ASP Grounder Gringo , 2009, LPNMR.
[86] David G. Mitchell,et al. A Framework for Representing and Solving NP Search Problems , 2005, AAAI.
[87] Raymond Reiter,et al. Equality and Domain Closure in First-Order Databases , 1980, JACM.
[88] Roland H. C. Yap,et al. Solving functional constraints by variable substitution , 2010, Theory and Practice of Logic Programming.
[89] Martin Gebser,et al. Solution Enumeration for Projected Boolean Search Problems , 2009, CPAIOR.
[90] Koen Claessen,et al. New techniques that improve mace-style model nding , 2003 .
[91] Maurice Bruynooghe,et al. Constraint Propagation for First-Order Logic and Inductive Definitions , 2013, TOCL.
[92] Christopher Mears,et al. Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.
[93] Amir Aavani,et al. Enfragmo: A System for Grounding Extended First-Order Logic to SAT , 2014 .
[94] Gerda Janssens,et al. Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3 , 2013, Theory Pract. Log. Program..
[95] Johan Wittocx,et al. Grounding FO and FO(ID) with Bounds , 2010, J. Artif. Intell. Res..
[96] Peter Baumgartner,et al. Model Evolution with equality - Revised and implemented , 2012, J. Symb. Comput..
[97] Eugenia Ternovska,et al. A logic of nonmonotone inductive definitions , 2008, TOCL.
[98] Peter J. Stuckey,et al. The Proper Treatment of Undefinedness in Constraint Languages , 2009, CP.
[99] Maurice Bruynooghe,et al. Modeling Machine Learning and Data Mining Problems with FO(·) , 2012, ICLP.
[100] Martin Gebser,et al. Challenges in Answer Set Solving , 2011, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning.
[101] Peter J. Stuckey,et al. The Design of the Zinc Modelling Language , 2008, Constraints.
[102] Mario Alviano,et al. The Fourth Answer Set Programming Competition: Preliminary Report , 2013, LPNMR.
[103] Albert Oliveras,et al. Fast congruence closure and extensions , 2007, Inf. Comput..
[104] Victor W. Marek,et al. Logic programming revisited , 2001, ACM Trans. Comput. Log..
[105] B. V. Fraassen. Singular Terms, Truth-Value Gaps, and Free Logic , 1966 .
[106] Koen Decroix,et al. A Formal Approach for Inspecting Privacy and Trust in Advanced Electronic Services , 2013, ESSoS.
[107] Philipp Rümmer,et al. A Constraint Sequent Calculus for First-Order Logic with Linear Integer Arithmetic , 2008, LPAR.