Chargement en cours...

Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis

The abduction problem in logic asks whether there exists a formula that is consistent with a given set of axioms and, together with these axioms, suffices to entail a given goal. We propose an approach for solving this problem that is based on syntax-guided enumeration. For scalability, we use a nov...

Description complète

Enregistré dans:
Détails bibliographiques
Publié dans:Automated Reasoning
Auteurs principaux: Reynolds, Andrew, Barbosa, Haniel, Larraz, Daniel, Tinelli, Cesare
Format: Artigo
Langue:Inglês
Publié: 2020
Sujets:
Accès en ligne:https://ncbi.nlm.nih.gov/pmc/articles/PMC7324138/
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51074-9_9
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!