First order abduction via tableau and sequent calculi

DOI10.1093/jigpal/1.1.99zbMath0807.03005OpenAlexW1973279396WikidataQ55970403 ScholiaQ55970403MaRDI QIDQ4291873

Marta Cialdea Mayer, Fiora Pirri

Publication date: 22 June 1994

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: http://jigpal.oxfordjournals.org/content/1/1.toc

zbMATH Keywords

algorithmfirst-order abductiondynamic Skolemizationproof-search tree

Mathematics Subject Classification ID

Related Items (15)

Quantifier-Free Equational Logic and Prime Implicate Generation ⋮ Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation ⋮ Intuitive minimal abduction in sequent calculi ⋮ Temporal abductive reasoning about biochemical reactions ⋮ Abduction as deductive saturation: a proof-theoretic inquiry ⋮ ABox abduction in the description logic \(\mathcal{ALC}\) ⋮ A logic for best explanations ⋮ An epistemic and dynamic approach to abductive reasoning: abductive problem and abductive solution ⋮ Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction ⋮ On Search for Law-Like Statements as Abductive Hypotheses by Socratic Transformations ⋮ Inferential conditionals and evidentiality ⋮ A conditional logic for abduction ⋮ A superposition calculus for abductive reasoning ⋮ Abduction via C-tableaux and δ-resolution ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments

This page was built for publication: First order abduction via tableau and sequent calculi