SAT Solving for Argument Filterings

DOI10.1007/11916277_3zbMath1165.68484arXivcs/0605074OpenAlexW1629587635MaRDI QIDQ5387882

Michael Codish, René Thiemann, V. Lagoon, Peter Schneider-Kamp, Jürgen Giesl

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0605074

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)

Related Items

KBO orientability, SAT solving for termination proofs with recursive path orders and dependency pairs, Proving Termination with (Boolean) Satisfaction