Answer set programming at a glance

Brewka, Gerhard; Eiter, Thomas; Truszczyński, Mirosław

doi:10.1145/2043174.2043195

Cited by 707 publications

(565 citation statements)

References 34 publications

Supporting

Mentioning

559

Contrasting

Unclassified

Order By: Relevance

“…Informally speaking, answer sets are those models of a program that are in some very precise way "justified" by the program. We refer for the formal definition to the overview by Brewka et al [2]. For instance, the program…”

Section: Asp: Generate and Test Methodologymentioning

confidence: 99%

“…It is oriented towards combinatorial search problems. Search problems with large variable domains pose a major challenge to the current generation of answer-set programming (ASP) systems, which require that the answer-set program representing the problem first be grounded by an ASP grounder and only then solved by an ASP solver [2]. The difficulty is that large variable domains make grounding take long, sometimes prohibitively long, time and result in large ground theories that often make solving infeasible, even though the problem may in fact be quite easy.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving

Lierler

Smith

Truszczyński

et al. 2012

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Abstract. Search problems with large variable domains pose a challenge to current answer-set programming (ASP) systems as large variable domains make grounding take a long time, and lead to large ground theories that may make solving infeasible. To circumvent the "grounding bottleneck" researchers proposed to integrate constraint solving techniques with ASP in an approach called constraint ASP (CASP). In the paper, we evaluate an ASP system clingo and a CASP system clingcon on a handcrafted problem involving large integer domains that is patterned after the database task of determining the optimal join order. We find that search methods used by clingo are superior to those used by clingcon, yet the latter system, not hampered by grounding, scales up better. The paper provides evidence that gains in solver technology can be obtained by further research on integrating ASP and CSP technologies.

show abstract

Section: Asp: Generate and Test Methodologymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving

Lierler

Smith

Truszczyński

et al. 2012

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

show abstract

“…We rely on a declarative language, Answer Set Programming (ASP) [7], to carry out the preliminary tasks before instantiating an argumentation framework ( Figure 2). In our work, we utilize the ASP Solver DLV-Complex [8] to take advantages of its built-in data structures and functions.…”

Section: Instantiate Argumentation Frameworkmentioning

confidence: 99%

“…Many thanks to SAP 6 and MOM 7 for providing use cases and data sets as well as evaluating our tool.…”

Section: Acknowledgmentmentioning

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

“…We seek to combine spatial reasoning, (nonmonotonic) logic programming rules (such as Answer Set Programming [6], Prolog [2], or Semantic Web Rule Language (SWRL) [17]), and ontologies for interleaving the different approaches. Besides having rules to formalize spatial integrity constraints [1], rules opens a way to qualitative spatial reasoning with the Region Connection Calculus (RCC) being applied on top of ontologies and spatial data [15].…”

Section: Background and Problem Statementmentioning

confidence: 99%

DC Proposal: Towards a Framework for Efficient Query Answering and Integration of Geospatial Data

Schneider

2011

The Semantic Web – ISWC 2011

View full text Add to dashboard Cite

Abstract. Semantic Web technologies are becoming more interleaved with geospatial databases, which should lead to an easier integration and querying of spatial data. This is fostered by a growing amount of publicly available geospatial data like OpenStreetMap. However, the integration can lead to geographic inconsistencies when combining multiple knowledge bases. Having the integration in place, users might not just issue a points-of-interest search, but rather might be interested in regions with specific attributes assigned to them. Though, having large amounts of spatial data available, standard databases and reasoners do not provide the means for (quantitative) spatial queries, or struggle to answer them efficiently. We seek to combine spatial reasoning, (nonmonotonic) logic programming, and ontologies for integrating geospatial databases with Semantic Web technologies. The focus of our investigation will be on a modular design, on efficient processing of large amounts of spatial data, and on enabling default reasoning. We propose a two-tier design related to HEX-programs, which should lead to a plausible trade-off between modularity and efficiency. Furthermore, we consider suitable geo-ontologies to semantically annotate and link different sources. Finally, the findings should lead to a proof-of-concept implementation, which will be tested for efficiency and modularity in artificial and real-world use cases.

show abstract

Answer set programming at a glance

Abstract: The motivation and key concepts behind answer set programming---a promising approach to declarative problem solving.

Cited by 707 publications

References 34 publications

Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving

Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving

Collaborative Schema Matching Reconciliation

DC Proposal: Towards a Framework for Efficient Query Answering and Integration of Geospatial Data

Contact Info

Product

Resources

About