Declarative encodings of acyclicity properties

Gebser, Martin; Janhunen, Tomi; Rintanen, Jussi

doi:10.1093/logcom/exv063

Cited by 7 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An important advantage of this approach is that offthe-shelf SAT solvers can be used to check acyclicity for the output formula. Examples of explicit encodings are transitive closure (Brooks et al 2007;Cussens 2008;Brewka, Eiter, and Truszczynski 2011), topological sorting with indices (Gebser, Janhunen, and Rintanen 2020), tree reduction (Corander et al 2013;Tamura et al 2009), and matrix multiplication encoding (Janota, Grigore, and Manquinho 2017).…”

Section: Acyclicitymentioning

confidence: 99%

“…In this work we address the satisfiability of propositional formulas with underlying directed graphs, under reachability and acyclicity constraints. The motivation for our work is the difficult trade-off between size and propagation strength in existing encodings of these constraints (Gebser, Janhunen, and Rintanen 2020) on one hand, and the effort in implementing specialized graph constraint propagators (Gebser, Janhunen, and Rintanen 2014b), and adapting and embedding them in SAT solvers, on the other.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination

Rankooh

Rintanen

2022

AAAI

Self Cite

View full text Add to dashboard Cite

We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs, based on vertex elimination graphs, which makes them suitable for cases where the underlying graph has a low directed elimination width. In contrast to solvers with ad hoc constraint propagators for graph constraints such as GraphSAT, our methods encode these constraints as standard propositional clauses, making them directly applicable with any SAT solver. An empirical study demonstrates that our methods do often outperform both earlier encodings of these constraints as well as GraphSAT especially when underlying graphs have a low directed elimination width.

show abstract

Section: Acyclicitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination

Rankooh

Rintanen

2022

AAAI

Self Cite

View full text Add to dashboard Cite

show abstract

“…Detecting cycles in both undirected and directed graphs were intensively studied (e.g., [5,6,7,9,10,11,16,17,18,19,20,21,22]). Cartesian function products were studied as well, but not intensively (e.g., [23,24]).…”

Section: Related Workmentioning

confidence: 99%

On MatBase’s algorithm for preventing cycles in binary Cartesian function products

Mancas¹

2022

World J. Adv. Eng. Technol. Sci.

View full text Add to dashboard Cite

show abstract

“…ASP encodings for transitivity are present in many applications. In particular, ASP encodings for acyclicity properties have been studied by Gebser, Janhunen, and Rintanen [GJR15], who included transitive closure in several of their encodings. Similar as in our experiments, tightness makes a relevant difference.…”

Section: Related Workmentioning

confidence: 99%

Adjudication of Coreference Annotations via Answer Set Optimization

Schüller

2017

Logic Programming and Nonmonotonic Reasoning

View full text Add to dashboard Cite

We describe the first automatic approach for merging coreference annotations obtained from multiple annotators into a single gold standard. This merging is subject to certain linguistic hard constraints and optimization criteria that prefer solutions with minimal divergence from annotators. The representation involves an equivalence relation over a large number of elements. We use Answer Set Programming to describe two representations of the problem and four objective functions suitable for different datasets. We provide two structurally different real-world benchmark datasets based on the METU-Sabanci Turkish Treebank and we report our experiences in using the Gringo, Clasp, and Wasp tools for computing optimal adjudication results on these datasets. * This work extends prior work [Sch17] with a semi-automatic adjudication encoding, extended formal descriptions and discussions, a tool description, and several additional examples. This is a preprint of [Sch18].Tuggener [Tug14] compares the accuracy of coreference resolution systems when used as preprocessing for discourse analysis, summarization, and finding entity contexts.Adjudication is the task of combining mention and chain information from several human annotators into one single gold standard corpus. These annotations are often mutually conflicting and resolving these conflicts is a task that is global on the document level, i.e., it is not possible to decide the truth of the annotation of one token, mention, or chain, without considering other tokens, mentions, and chains in the same document.We here present results and experiences obtained in a two-year project for creating a Turkish coreference corpus [Sch+17], which included an effort for developing and improving a (semi)automatic solution for coreference adjudication. We produced two datasets which are assembled from 475 individual annotations of 33 distinct documents from the METU-Sabanci Turkish Treebank [Say+04]. Adjudicating documents manually with tools such as BART [Ver+08] is usually done on a small set of annotations, for example, coreference annotations in the OntoNotes corpus [Pra+07] were created by at most two independent annotators per document. In the Turkish corpus, we needed to adjudicate between eight and twelve independent coreference annotations. Given such a high number of annotations, it is suggestive to use majorities of annotator decisions for suggesting an adjudication solution to the human annotator.In this paper, we describe a (semi-)automatic solution for supporting adjudication of coreference annotations based on Answer Set Programming (ASP) [Bar04; Lif08; BET11; Geb+12]. ASP is a logic programming and knowledge representation paradigm that allows for a declarative specification of problems and is suitable for solving large-scale combinatorial optimization problems.Our contributions are as follows.

show abstract

Declarative encodings of acyclicity properties

Cited by 7 publications

References 21 publications

Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination

Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination

On MatBase’s algorithm for preventing cycles in binary Cartesian function products

Adjudication of Coreference Annotations via Answer Set Optimization

Contact Info

Product

Resources

About