Computable Functions in ASP: Theory and Implementation

Calimeri, Francesco; Cozza, Susanna; Ianni, Giovambattista; Leone, Nicola

doi:10.1007/978-3-540-89982-2_37

Cited by 90 publications

(129 citation statements)

References 15 publications

Supporting

Mentioning

127

Contrasting

Order By: Relevance

“…It is tailored to efficient evaluation of arbitrary programs, rather than to facilitate module-style logic programming with declarative specifications. In this regard, it is in line with previous work on HEX program evaluation [7] and decomposition techniques for efficient grounding of ordinary programs [3].…”

Section: Discussionsupporting

confidence: 83%

See 1 more Smart Citation

Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

Eiter

Fink

Ianni

et al. 2011

Logic Programming and Nonmonotonic Reasoning

Self Cite

View full text Add to dashboard Cite

Abstract. The evaluation of logic programs with access to external knowledge sources requires to interleave external computation and model building. Deciding where and how to stop with one task and proceed with the next is a difficult problem, and existing approaches have severe scalability limitations in many real-world application scenarios. We introduce a new approach for organizing the evaluation of logic programs with external knowledge sources and describe a configurable framework for dividing the non-ground program into overlapping possiblysmaller parts called evaluation units. These units will then be processed by interleaving external evaluations and model building according to an evaluation and a model graph, and by combining intermediate results. Experiments with our prototype implementation show a significant improvement of this technique compared to existing approaches. Interestingly, even for ordinary logic programs (with no external access), our decomposition approach speeds up existing state of the art ASP solvers in some cases, showing its potential for wider usage.

show abstract

Section: Discussionsupporting

confidence: 83%

“…One external atom will be evaluated for each input model of u 2 . Then, we evaluate {r 2 , c 5 }, which yields output model m 5 for input m 4 , and no model for m 3 . For each input model of u 3 two models are generated by r 3 .…”

Section: Discussionmentioning

confidence: 99%

Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

Eiter

Fink

Ianni

et al. 2011

Logic Programming and Nonmonotonic Reasoning

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our work, we utilize the ASP Solver DLV-Complex [8] to take advantages of its built-in data structures and functions. We invoke an ASP program called Π pre , which is essentially the union of other ASP program, each of which is responsible for a specific task.…”

Section: Instantiate Argumentation Frameworkmentioning

confidence: 99%

“…It is developed by using the Java programming language and the JUNG 4 library for visualization purposes. We also integrate other supporting libraries, including Vispatrix [11] and DLV-Complex [8]. We have also made the source code to be publicly available at our website 5 .…”

Section: Realizing Servicesmentioning

confidence: 99%

Collaborative Schema Matching Reconciliation

Nguyen

Luong

Miklós

et al. 2013

On the Move to Meaningful Internet Systems: OTM 2013 Conferences

View full text Add to dashboard Cite

Abstract. Schema matching is the process of establishing correspondences between the attributes of database schemas for data integration purpose. Although several schema matching tools have been developed, their results are often incomplete or erroneous. To obtain correct attribute correspondences, in practice, human experts edit the mapping results and fix the mapping problems. As the scale and complexity of data integration tasks have increased dramatically in recent years, the reconciliation phase becomes more and more a bottleneck. Moreover, one often needs to establish the correspondences in not only between two but a network of schemas simultaneously. In such reconciliation settings, it is desirable to involve several experts. In this paper, we propose a tool that supports a group of experts to collaboratively reconcile a set of matched correspondences. The experts might have conflicting views whether a given correspondence is correct or not. As one expects global consistency conditions in the network, the conflict resolution might require discussion and negotiation among the experts to resolve such disagreements. We have developed techniques and a tool that allow approaching this reconciliation phase in a systematic way. We represent the expert's views as arguments to enable formal reasoning on the assertions of the experts. We detect complex dependencies in their arguments, guide and present them the possible consequences of their decisions. These techniques thus can greatly help them to overlook the complex cases and work more effectively.

show abstract

“…Syntactically restricted fragments, such as ω-restricted programs (Syrjänen 2001), λ-restricted programs (Gebser et al 2007), finite-domain programs (Calimeri et al 2008a), argument-restricted programs (Lierler and Lifschitz 2009), FDNC programs (Simkus and Eiter 2007), bidirectional programs (Eiter and Simkus 2009), and the proposal of (Lin and Wang 2008); these approaches introduce syntactic constraints (which can be easily checked at small computational cost) or explicit domain restrictions, thus allowing computability of answer sets and/or decidability of querying; 2. Semantically restricted fragments, such as finitely ground programs (Calimeri et al 2008a), finitary programs (Bonatti 2002;Bonatti 2004), disjunctive finitelyrecursive programs (Baselice et al 2009) and queries (Calimeri et al 2009); with respect to syntactically restricted fragments, these approaches aim at identifying broader classes of programs for which computational tasks such as querying are decidable. However, the membership of programs in these fragments is undecidable in general.…”

Section: Related Workmentioning

confidence: 99%

Disjunctive ASP with functions: Decidable queries and effective computation

Alviano¹,

Faber²,

Leone³

2010

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

Querying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASP fs ). We show that query answering in this setting is decidable, if the query is finitely recursive (ASP fs fr ). Our proof yields also an effective method for query evaluation. It is done by extending the magic set technique to ASP fs fr . We show that the magic-set rewritten program is query equivalent to the original one (under both brave and cautious reasoning). Moreover, we prove that the rewritten program is also finitely ground, implying that it is decidable. Importantly, finitely ground programs are evaluable using existing ASP solvers, making the class of ASP fs fr queries usable in practice.

show abstract

Computable Functions in ASP: Theory and Implementation

Cited by 90 publications

References 15 publications

Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

Pushing Efficient Evaluation of HEX Programs by Modular Decomposition

Collaborative Schema Matching Reconciliation

Disjunctive ASP with functions: Decidable queries and effective computation

Contact Info

Product

Resources

About