Zobrazeno 1 - 10
of 182
pro vyhledávání: '"Truszczynski, Miroslaw"'
Knowledge Representation and Reasoning is a central, longstanding, and active area of Artificial Intelligence. Over the years it has evolved significantly; more recently it has been challenged and complemented by research in areas such as machine lea
Externí odkaz:
http://arxiv.org/abs/2308.04161
Publikováno v:
EPTCS 325, 2020, pp. 96-109
Answer set programming is a leading declarative constraint programming paradigm with wide use for complex knowledge-intensive applications. Modern answer set programming languages support many equivalent ways to model constraints and specifications i
Externí odkaz:
http://arxiv.org/abs/2009.10240
Autor:
Liu, Liu, Truszczynski, Miroslaw
Publikováno v:
EPTCS 306, 2019, pp. 302-308
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 classes of problem instances. We claim that one can improve the solving
Externí odkaz:
http://arxiv.org/abs/1909.08252
Autor:
Lonc, Zbigniew, Truszczynski, Miroslaw
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 to allocate goods to agents so that each agent's bundle forms a connec
Externí odkaz:
http://arxiv.org/abs/1905.03038
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 about the domain of discourse is studied in the theory of the informal
Externí odkaz:
http://arxiv.org/abs/1901.09125
We propose two models of random quantified boolean formulas and their natural random disjunctive logic program counterparts. The models extend the standard models of random k-CNF formulas and the Chen-Interian model of random 2QBFs. The first model c
Externí odkaz:
http://arxiv.org/abs/1802.03828
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 NP is of interest from the theoretical standpoint and can potentially
Externí odkaz:
http://arxiv.org/abs/1507.05388
Publikováno v:
In Artificial Intelligence February 2020 279
Publikováno v:
Theory and Practice of Logic Programming 14 (2014) 665-679
We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of \emph{arbitrariness}: the more arbitrary the explanat
Externí odkaz:
http://arxiv.org/abs/1405.2494
Publikováno v:
Theory and Practice of Logic Programming 15 (2015) 18-34
Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunct
Externí odkaz:
http://arxiv.org/abs/1403.6689