Progress in Computing Applications(PCA)

DLINE Journals portal

Home

New Journals

Browse Journals

Journal Prices

For Authors

Print ISSN:
Online ISSN:

About PCA
	DLINE Portal Home Home Aims & Scope Editorial Board Current Issue Next Issue Previous Issue Sample Issue Upcoming Conferences Self-archiving policy Alert Services Be a Reviewer Publisher Paper Submission Subscription Contact us

How To Order
	Order Online Price Information Request for Complimentary Print Copy

For Authors
	Guidelines for Contributors Online Submission Call for Papers Author Rights

RELATED JOURNALS

Journal of Digital Information Management (JDIM)

Journal of Multimedia Processing and Technologies (JMPT)

International Journal of Web Application (IJWA)

Progress in Computing Applications(PCA)

Creation of Abstract Syntax for Declarative Logic Programming

Marco alberti and Marco Gavanelli and Evelina Lamma
CENTRIA, DI-FCT, universidade nova de lisboa, portugal ENDIF, universita di ferrara, italy

Abstract: Abductive logic programming is a logical representation of abductive reasoning. Most ALP frameworks express domain-specific logical relationships that the abductive answers must satisfy. A priori, the integrity constraints are known. However, for some applications (e.g., Interactive Abduction Logic Programming, Multi-Agent Interactions, Contracting), it is reasonable to loosen this assumption so that the abductive reasoning process starts incompletely aware of the integrity constraints and continues without restarting when a new integrity constraint is known. In the present paper, we provide an abstract syntax for the declarative logic programming of abductive logic, with the addition of integrity constraint during the process of abductive reasoning, an operational implementation with formal termination, good and completeness properties, and an implementation based on SCIFF language and proof procedure.

Keywords: Abductive Logic Programming, Abductive Reasoning, Declarative Logic Programming, Abstract Syntax Creation of Abstract Syntax for Declarative Logic Programming

DOI:https://doi.org/10.6025/jdp/2024/14/1/1-10

Full_Text PDF 1.24 MB Download: 22 times

References:

[1] Abdennadher, Slim., Christiansen, Henning. (2000). An experimental CLP platform for integrity constraints and abduction. In Henrik Legind Larsen, Janusz Kacprzyk, Slawomir Zadrozny, Troels Andreasen., Henning Christiansen (Eds.), FQAS, pp. 141-152. Physica-Verlag, Heidelberg.
[2] Alberti, Marco, Chesani, Federico, Gavanelli, Marco, Lamma, Evelina, Mello, Paola., Torroni, Paolo. (2008). Verifiable agent interaction in abductive logic programming: The SCIFF framework. ACM Transactions on Computational Logics, 9(4).
[3] Alberti, Marco, Gavanelli, Marco., Lamma, Evelina. (2010). Runtime addition of integrity constraints in SCIFF. Tech. Rep. cs-2010-01, Universitadegli Studi di Ferrara, Dipartimento di Ingegneria. Available at http://www.unife.it/dipartimento/ingegneria/informazione/informatica/ rapportitecnici-1.
[4] Alferes, José Júlio, Pereira, Luís Moniz., Swift, Terrance. (1999). Well-founded abduction via tabled dual programs. In D. De Schreye (Ed.), ICLP, pp. 426-440.
[5] Alferes, José Júlio, Brogi, Antonio, Leite, João Alexandre., Pereira, Luís Moniz. (2002). Evolving logic programs. In Sergio Flesca, Sergio Greco, Nicola Leone., Giovambattista Ianni (Eds.), JELIA, Lecture Notes in Computer Science, vol. 2424, pp. 50-61. Springer.
[6] Apt, Krzysztof R.., Bezem, Marc. (1991). Acyclic programs. New Generation Computing, 9(3/ 4), 335-364.
[7] Balduccini, Marcello., Gelfond, Michael. (2003). Logic programs with consistency-restoring rules. In AAAI Spring 2003 Symposium, pp. 9-18.
[8] Chesani, Federico, Lamma, Evelina, Mello, Paola, Montali, Marco, Riguzzi, Fabrizio., Storari, Sergio. (2009). Exploiting inductive logic programming techniques for declarative process mining. T. Petri Nets and Other Models of Concurrency, 2, 278-295.
[9] Christiansen, Henning. (2005). Experiences and directions for abduction and induction using constraint handling rules. In: Workshop on abduction and induction AIAI’05. Edinburgh, Scotland.
[10] Christiansen, Henning., Dahl, Verónica. (2005). HYPROLOG: A new logic programming language with assumptions and abduction. In Maurizio Gabbrielli and Gopal Gupta (Eds.), ICLP, Lecture Notes in Computer Science, vol. 3668, pp. 159-173. Springer.
[11] Denecker, Marc., De Schreye, Danny. (1998). SLDNFA: An abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2), 111-167.
[12] Fruhwirth, T. (1998). Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1-3), 95-138.
[13] Fung, T. H.., Kowalski, R. A. (1997). The IFF proof procedure for abductive logic programming. Journal of Logic Programming, 33(2), 151-165.
[14] Hodas, Joshua S.., Miller, Dale. (1994). Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2), 327-365.
[15] Jaar, J.., Maher, M. J. (1994). Constraint logic programming: A survey. Journal of Logic Programming, 19-20, 503-582.
[16] Jaar, Joxan, Maher, Michael, Marriott, Kim., Stuckey, Peter. (1994). The semantics of constraint logic programs. Journal of Logic Programming.
[17] Kakas, A. C.., Mancarella, Paolo. (1990). On the relation between Truth Maintenance and Abduction. In T. Fukumura (Ed.), Proceedings of the 1st Pacific Rim International Conference on Artificial Intelligence, PRICAI-90, Nagoya, Japan, pp. 438-443. Ohmsha Ltd.
[18] Kakas, A. C., Kowalski, R. A.., Toni, Francesca. (1993). Abductive Logic Programming. Journal of Logic and Computation, 2(6), 719-770.
[19] Kunen, Kenneth. (1987). Negation in logic programming. Journal of Logic Programming, 4(4), 289-308.
[20] Lamma, Evelina, Mello, Paola, Montali, Marco, Riguzzi, Fabrizio., Storari, Sergio. (2007). Inducing declarative logic-based models from labeled traces. In Gustavo Alonso, Peter Dadam, and Michael Rosemann (Eds.), BPM, Lecture Notes in Computer Science, vol. 4714, pp. 344-359. Springer.
[21] Lamma, Evelina, Mello, Paola, Riguzzi, Fabrizio., Storari, Sergio. (2007). Applying inductive logic programming to process mining. In Hendrik Blockeel, Jan Ramon, Jude W. Shavlik, and Prasad Tadepalli (Eds.), ILP, Lecture Notes in Computer Science, vol. 4894, pp. 132-146. Springer.
[22] Lopes, Gonçalo., Pereira, Luís Moniz. (2006). Prospective programming with ACORDA. In Empirically Successful Computerized Reasoning (ESCoR’06) workshop at The 3rd International Joint Conference on Automated Reasoning (IJCAR’06). Seattle, USA.
[23] McCarty, L. Thorne. (1988). Clausal intuitionistic logic I - Fixed-point semantics. Journal of Logic Programming, 5(1), 1-31.
[24] Miller, Dale. (1989). A logical analysis of modules in logic programming. Journal of Logic Programming, 6(1-2), 79-108.
[25] Nadathur, Gopalan., Miller, Dale. (1988). An overview of lambda-prolog. In ICLP/SLP, pp. 810- 827.
[26] Schrijvers, T.., Demoen, B. (2004). The K.U. Leuven CHR system: Implementation and application. In T. Fruhwirth and M. Meister (Eds.), First Workshop on Constraint Handling Rules.
[27] The SCIFF abductive proof procedure. (2010). Retrieved from http://lia.deis.unibo.it/research/ sciff/.
[28] Wang, Kewen. (2000). Argumentation-based abduction in disjunctive logic programming. Journal of Logic Programming, 45(1-3), 105-141.
[29] Xanthakos, I. (2003). Semantic Integration of Information by Abduction (Ph.D. thesis). Imperial College London. Retrieved from http://www.doc.ic.ac.uk/~ix98/PhD

DLINE Journals portal