141 citations · 303 across the 30 of their papers we have counts for
31 papers
Automated Aggregator -- Rewriting with the Counting Aggregate
Michael Dingess, Miroslaw Truszczynski
Answer set programming is a leading declarative constraint programming paradigm with wide use for complex knowledge-intensive applications. Modern answer set programming languages…
Encoding Selection for Solving Hamiltonian Cycle Problems with ASP
Liu Liu, Miroslaw Truszczynski
It is common for search and optimization problems to have alternative equivalent encodings in ASP. Typically none of them is uniformly better than others when evaluated on broad cl…
Beyond NP: Quantifying over Answer Sets
Giovanni Amendola, Francesco Ricca, Mirek Truszczynski
Answer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems i…
Maximin share allocations on cycles
Zbigniew Lonc, Miroslaw Truszczynski
The problem of fair division of indivisible goods is a fundamental problem of social choice. Recently, the problem was extended to the case when goods form a graph and the goal is…
The informal semantics of Answer Set Programming: A Tarskian perspective
Marc Denecker, Yuliya Lierler, Miroslaw truszczynski +1
In Knowledge Representation, it is crucial that knowledge engineers have a good understanding of the formal expressions that they write. What formal expressions state intuitively a…
Dual-normal Logic Programs - the Forgotten Class
Johannes K. Fichte, Miroslaw Truszczynski, Stefan Woltran
Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in…