Loading...
Please wait, while we are loading the content...
Similar Documents
Abduction through semantic tableaux versus abduction through goal-directed proofs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Meheus, Joke Provijn, Dagmar |
| Copyright Year | 2007 |
| Abstract | In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Aliseda's approach based on semantic tableaux. We begin with some comments on Alis- eda's algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive explanations are a natural spin-off of these proofs. Finally, we show that the goal-directed procedure solves the problems we encountered in Aliseda's algorithms. |
| Starting Page | 295 |
| Ending Page | 304 |
| Page Count | 10 |
| File Format | PDF HTM / HTML |
| DOI | 10.1387/theoria.450 |
| Volume Number | 22 |
| Alternate Webpage(s) | http://logica.ugent.be/joke/artikels/gda.ps |
| Alternate Webpage(s) | http://logica.ugent.be/joke/artikels/gda.pdf |
| Alternate Webpage(s) | https://biblio.ugent.be/publication/431158/file/6810780.pdf |
| Alternate Webpage(s) | https://www.redalyc.org/pdf/3397/339730804005.pdf |
| Alternate Webpage(s) | http://philsci-archive.pitt.edu/10416/1/450-633-1-PB.pdf |
| Alternate Webpage(s) | http://www.ehu.eus/ojs/index.php/THEORIA/article/download/450/440 |
| Alternate Webpage(s) | https://doi.org/10.1387/theoria.450 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
