Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Miroslaw Truszczynski"'
Autor:
Liu Liu, Miroslaw Truszczynski
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 302-308 (2019)
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:
https://doaj.org/article/f3c31eccf1154bd49a3eb891fecbdfd7
Publikováno v:
Theory and Practice of Logic Programming. 22:770-775
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05258ad0978c16e99f4c8456c8aa9d25
https://doi.org/10.1017/s1471068422000345
https://doi.org/10.1017/s1471068422000345
Publikováno v:
The International FLAIRS Conference Proceedings. 35
There has been a great deal of research into methods for representing preferences, called preference representation languages. Often, research in this area deals with a limited number of similar languages, in isolation. This work establishes a new me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7ee1e8f830f3739f630e936abfefbff
https://doi.org/10.32473/flairs.v35i.130651
https://doi.org/10.32473/flairs.v35i.130651
Autor:
Michael Dingess, Miroslaw Truszczynski
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 325: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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::367eb9bb33d7397b499e4dd506b1546e
https://doi.org/10.4204/eptcs.325.17
https://doi.org/10.4204/eptcs.325.17
Publikováno v:
Theory and Practice of Logic Programming. 23:1-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e51576a035eca0e9e0a6715cd7cf6a43
https://doi.org/10.1017/s1471068422000394
https://doi.org/10.1017/s1471068422000394
Publikováno v:
Theory and Practice of Logic Programming. 19:705-721
Answer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems in NP in a compact and elegant way. However, modeling problems beyond N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6716ff6deb28136942c5572e86581ae
https://doi.org/10.1017/s1471068419000140
https://doi.org/10.1017/s1471068419000140
Autor:
Miroslaw Truszczynski, Xudong Liu
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 87:137-155
We study preference representation models based on partial lexicographic preference trees (PLP-trees). We propose to represent preference relations as forests of small PLP-trees (PLP-forests), and to use voting rules to aggregate orders represented b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c76630dc04699ad356d91363d45ec245
https://doi.org/10.1007/s10472-019-09645-7
https://doi.org/10.1007/s10472-019-09645-7
Publikováno v:
Logic Journal of the IGPL. 27:777-811
This paper introduces and studies a declarative framework for updating views over indefinite databases. An indefinite database is a database with null values that are represented, following the standard database approach, by a single null constant. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9d7f33e4cb7e2414cc784bee63d6ff3
https://doi.org/10.1093/jigpal/jzz003
https://doi.org/10.1093/jigpal/jzz003
Publikováno v:
FLAIRS Conference
Learning preferences of an agent requires choosing which preference representation to use. This formalism should be expressive enough to capture a significant part of the agent's preferences. Selecting the right formalism is generally not easy, as we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::142a04cbbd28b177a24e780e43984f95
https://doi.org/10.32473/flairs.v34i1.128489
https://doi.org/10.32473/flairs.v34i1.128489
Autor:
Miroslaw Truszczynski, Xudong Liu
Publikováno v:
Algorithmic Decision Theory ISBN: 9783030877552
ADT
ADT
We introduce probabilistic lexicographic preference trees (or PrLPTs for short). We show that they offer intuitive and often compact representations of non-deterministic qualitative preferences over alternatives in multi-attribute (or, combinatorial)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::806bae2693bd0ceb97ca96be490a7885
https://doi.org/10.1007/978-3-030-87756-9_6
https://doi.org/10.1007/978-3-030-87756-9_6
