Parameterized Resolution with Bounded Conjunction

Stefan Dantchev, Barnaby Martin

Type: Book-Chapter

Publication Date: 2013-01-01

Citations: 1

DOI: https://doi.org/10.1007/978-3-642-38536-0_12

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Parameterized Resolution with bounded conjunction	2012	Stefan Dantchev Barnaby Martin
+	Parameterized Resolution with bounded conjunction	2012	Stefan Dantchev Barnaby Martin
+	Non-monotonic inference: characterization and combination	1998	Choh Man Teng Henry E. Kyburg
+	Resolution type theorems	2004	Steven Dale Cutkosky
+ PDF Chat	Efficient Certified Resolution Proof Checking	2017	Luís Cruz-Filipe João Marques‐Silva Peter Schneider–Kamp
+	Bounded Arithmetic vs. Propositional Calculus	1997	Noriko Arai
+	Bounded Arithmetic vs. Propositional Calculus	1997	紀子新井
+ PDF Chat	SHACL Constraints with Inference Rules	2019	Paolo Pareti George Konstantinidis Timothy J. Norman Murat Şensoy
+ PDF Chat	Constraint Satisfaction with Counting Quantifiers	2012	Florent Madelaine Barnaby Martin Juraj Stacho
+ PDF Chat	Automated Reasoning with Restricted Intensional Sets	2021	Maximiliano Cristiá Gianfranco Rossi
+	Recalculation formulae for a partially resolving operator	1992	A. Ya. Belyankov
+ PDF Chat	Partial predicate abstraction and counter-example guided refinement	2019	Tuba Yavuz
+ PDF Chat	Refinement Type Inference via Horn Constraint Optimization	2015	Kodai Hashimoto Hiroshi Unno
+	Horn Upper Bounds and Renaming	2007	Marina Langlois Robert H. Sloan György Turán
+ PDF Chat	Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning	2017	John Slaney Bruno Woltzenlogel Paleo
+ PDF Chat	Q-Resolution with Generalized Axioms	2016	Florian Lonsing Uwe Egly Martina Seidl
+	Completeness of Depth-Bounded Resolution for Weakly Reducing Programs	1989	Hiroki Arimura 博紀有村
+ PDF Chat	AC Simplifications and Closure Redundancies in the Superposition Calculus	2021	André Ricardo Barbosa Duarte Konstantin Korovin
+	Tactics for Reasoning Modulo AC in Coq	2011	Thomas Braibant Damien Pous
+ PDF Chat	Constraint Reductions	2019	Olivier Bailleux Yacine Boufkhad

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (3)

Action	Title	Year	Authors
+	On the Complexity of Resolution with Bounded Conjunctions	2002	Juan Luis Esteban Nicola Galesi Jochen Meßner
+ PDF Chat	On the weak pigeonhole principle	2001	Jan Krajı́ček
+	On the Automatizability of Resolution and Related Propositional Proof Systems	2002	Albert Atserias Marı́a Luisa Bonet