Theorem - PDFSEARCH.IO - Document Search Engine

Theorem
Results: 6939

#	Item
21	11 Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park. California Add to Reading List Source URL: www.kestrel.edu Language: English - Date: 2011-11-14 21:00:52 Mathematical logic Logic Model theory Metalogic Predicate logic Formal methods Resolution First-order logic Skolem normal form Automated theorem proving Quantifier Axiom
22	Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2017-07-31 12:00:20 Theoretical computer science Formal methods Mathematical logic School of Computer Science University of Manchester Mathematics Logic in computer science Automated theorem proving Formal verification SPASS Andrei Voronkov Vampire First-order logic
23	Making Automatic Theorem Provers more Versatile Simon Cruanes University of Lorraine, CNRS, Inria, LORIA, 54000 Nancy, France Abstract We argue that automatic theorem provers should become more versatile and should be ab Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2017-08-01 10:52:10 Theoretical computer science Software engineering Mathematical software Formal methods Logic in computer science Proof assistants Automated theorem proving Automated reasoning Satisfiability modulo theories E theorem prover ACL2 Isabelle
24	Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3 Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2017-07-31 05:29:21 Theoretical computer science Formal methods Mathematics Logic in computer science Mathematical logic Automated theorem proving School of Computer Science University of Manchester Automated reasoning Formal verification E theorem prover IP Satisfiability modulo theories
25	Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:36 Theoretical computer science NP-complete problems Formal methods Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Isabelle Constructible universe LCF Mathematics (SAT -UNSAT)
26	Bounded Model Generation for Isabelle/HOL and Related Applications of SAT Solvers in Interactive Theorem Proving Tjark Weber Add to Reading List Source URL: user.it.uu.se Language: English - Date: 2005-09-13 07:36:16 Computability theory Lambda calculus Theoretical computer science Model theory Higher-order logic Constructible universe Metaphilosophy Mathematics
27	Theory Learning and Logical Rule Induction with Neural Theorem Proving Andres Campero 1 Aldo Pareja 2 Tim Klinger 2 Josh Tenenbaum 1 Sebastian Riedel 3 1. Introduction A hallmark of human cognition is the ability to con Add to Reading List Source URL: uclmr.github.io Language: English - Date: 2018-08-06 06:17:49 Logic Reasoning Inductive reasoning Predicate logic Mathematical logic Predicate Propositional calculus Inference Universal quantification Axiom
28	The use of theorem-proving techniques in question-answering systems by C. CORDELL GREEN and BERTRAM RAPHAEL Stanford Research Institute Menlo Park, California Add to Reading List Source URL: www.kestrel.edu Language: English - Date: 2011-11-16 13:40:45 Logic Metalogic Mathematics Proof theory Model theory Mathematical logic Syntax First-order logic Well-formed formula Formal system Logic programming Resolution
29	Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2016-07-20 13:24:35 Theoretical computer science Automated theorem proving Mathematics Mathematical logic Formal methods Logic in computer science Resolution Logic programming Clause Vampire Boolean satisfiability problem CARINE
30	Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology Add to Reading List Source URL: www.logic.at Language: English - Date: 2014-04-14 05:43:30 Mathematical logic Proof theory Logic Mathematics Natural deduction Sequent calculus Sequent First-order logic Admissible rule Conjunctive normal form Quantifier Cut-elimination theorem