Sciweavers

3333 search results - page 2 / 667
» Abstract Proof Search
Sort
View
CG
2008
Springer
13 years 7 months ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
JETAI
2008
86views more  JETAI 2008»
13 years 5 months ago
Weighting strategy for non-clausal resolution
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
Zbigniew Stachniak, Anton Belov
TABLEAUX
2009
Springer
13 years 10 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu
ITS
2004
Springer
153views Multimedia» more  ITS 2004»
13 years 10 months ago
Modeling Students' Reasoning About Qualitative Physics: Heuristics for Abductive Proof Search
Abstract. We describe a theorem prover that is used in the Why2Atlas tutoring system for the purposes of evaluating the correctness of a student’s essay and for guiding feedback ...
Maxim Makatchev, Pamela W. Jordan, Kurt VanLehn
CADE
2008
Springer
14 years 5 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten