Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Ordered chaining calculi for first-order theories of transitive relations - MaRDI portal

Ordered chaining calculi for first-order theories of transitive relations

From MaRDI portal
Publication:3158528

DOI10.1145/293347.293352zbMath1065.68615OpenAlexW2027752737MaRDI QIDQ3158528

Leo Bachmair, Harald Ganzinger

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/293347.293352



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (23)

Automated theorem proving by resolution in non-classical logicsProof theory for locally finite many-valued logics: semi-projective logicsOn First-Order Model-Based ReasoningA first polynomial non-clausal class in many-valued logicModular proof systems for partial functions with Evans equalityDeciding expressive description logics in the framework of resolutionOn Automating the Calculus of RelationsResolution-based decision procedures for the universal theory of some classes of distributive lattices with operatorsCyclic connectionsTheorem proving in cancellative abelian monoids (extended abstract)Harald Ganzinger’s Legacy: Contributions to Logics and ProgrammingFrom Search to Computation: Redundancy Criteria and Simplification at WorkOn the Saturation of YAGOAn Extension of Complex Role Inclusion Axioms in the Description Logic $\mathcal{SROIQ}$Formalizing Bachmair and Ganzinger's ordered resolution proverOrdered chaining for total orderingsSPASS-AR: a first-order theorem prover based on approximation-refinement into the monadic shallow linear fragmentA Generalisation of the Hyperresolution Principle to First Order Gödel LogicHandling transitive relations in first-order automated reasoningAutomated verification of refinement lawsOn the refutational completeness of signed binary resolution and hyperresolutionHyperresolution for Gödel logic with truth constantsLayered clause selection for theory reasoning (short paper)


Uses Software



This page was built for publication: Ordered chaining calculi for first-order theories of transitive relations