141 citations · 303 across the 30 of their papers we have counts for
16 papers · 1 filter
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…
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…
The Computational Complexity of Dominance and Consistency in CP-Nets
Judy Goldsmith, Jerome Lang, Miroslaw Truszczyski +1
We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in w…
Abstract Modular Systems and Solvers
Yuliya Lierler, Miroslaw Truszczynski
Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts o…