default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslaw Truszczynski
Mirek Truszczynski – Mirosław Truszczyński
Person information
- unicode name: Mirosław Truszczyński
- affiliation: University of Kentucky, Department of Computer Science, Lexington, KY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j79]James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, Frank Wolter:
Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Perspectives Workshop 22282). Dagstuhl Manifestos 10(1): 1-61 (2024)- [i48]Giuseppe Mazzotta
, Francesco Ricca, Mirek Truszczynski:
Quantifying over Optimum Answer Sets. CoRR abs/2408.07697 (2024) - 2023
- [j78]Thomas Eiter, Michael J. Maher, Enrico Pontelli, Luc De Raedt, Miroslaw Truszczynski:
The Collection of Papers Celebrating the 20th Anniversary of TPLP, Part II. Theory Pract. Log. Program. 23(1): 1 (2023) - [i47]James P. Delgrande, Birte Glimm, Thomas Andreas Meyer, Miroslaw Truszczynski, Frank Wolter:
Current and Future Challenges in Knowledge Representation and Reasoning. CoRR abs/2308.04161 (2023) - 2022
- [j77]Thomas Eiter, Michael J. Maher, Enrico Pontelli, Luc De Raedt, Miroslaw Truszczynski:
Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP. Theory Pract. Log. Program. 22(6): 770-775 (2022) - [c132]Michael Huelsman, Miroslaw Truszczynski:
Relating Preference Languages By Their Expressive Power. FLAIRS 2022 - [c131]Giovanni Amendola, Bernardo Cuteri, Francesco Ricca, Mirek Truszczynski:
Solving Problems in the Polynomial Hierarchy with ASP(Q). LPNMR 2022: 373-386 - [c130]Liu Liu, Mirek Truszczynski, Yuliya Lierler:
A Machine Learning System to Improve the Performance of ASP Solving Based on Encoding Selection. LPNMR 2022: 415-428 - [i46]James P. Delgrande, Birte Glimm, Thomas Meyer, Miroslaw Truszczynski, Milene Santos Teixeira, Frank Wolter:
Current and Future Challenges in Knowledge Representation and Reasoning (Dagstuhl Seminar 22282). Dagstuhl Reports 12(7): 62-79 (2022) - 2021
- [c129]Xudong Liu, Miroslaw Truszczynski:
Probabilistic Lexicographic Preference Trees. ADT 2021: 86-100 - [c128]Michael Huelsman, Miroslaw Truszczynski:
The Role of Model Selection in Preference Learning. FLAIRS 2021 - 2020
- [j76]Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
New models for generating hard random boolean formulas and disjunctive logic programs. Artif. Intell. 279 (2020) - [j75]Miroslaw Truszczynski, Zbigniew Lonc:
Maximin Share Allocations on Cycles. J. Artif. Intell. Res. 69: 613-655 (2020) - [c127]Michael Huelsman, Miroslaw Truszczynski:
A Lexicographic Strategy for Approximating Dominance in CP-Nets. FLAIRS 2020: 59-74 - [c126]Michael Dingess, Miroslaw Truszczynski:
Automated Aggregator - Rewriting with the Counting Aggregate. ICLP Technical Communications 2020: 96-109
2010 – 2019
- 2019
- [j74]Xudong Liu, Miroslaw Truszczynski:
Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains. Ann. Math. Artif. Intell. 87(1-2): 137-155 (2019) - [j73]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
A logical framework for view updating in indefinite databases. Log. J. IGPL 27(6): 777-811 (2019) - [j72]Jan Maly, Miroslaw Truszczynski, Stefan Woltran:
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? J. Artif. Intell. Res. 66: 1147-1197 (2019) - [j71]Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
Beyond NP: Quantifying over Answer Sets. Theory Pract. Log. Program. 19(5-6): 705-721 (2019) - [c125]Xudong Liu, Miroslaw Truszczynski:
New Complexity Results on Aggregating Lexicographic Preference Trees Using Positional Scoring Rules. ADT 2019: 97-111 - [c124]Liu Liu, Miroslaw Truszczynski:
Encoding Selection for Solving Hamiltonian Cycle Problems with ASP. ICLP Technical Communications 2019: 302-308 - [i45]Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens:
The informal semantics of Answer Set Programming: A Tarskian perspective. CoRR abs/1901.09125 (2019) - [i44]Zbigniew Lonc, Miroslaw Truszczynski:
Maximin share allocations on cycles. CoRR abs/1905.03038 (2019) - [i43]Giovanni Amendola, Francesco Ricca, Mirek Truszczynski:
Beyond NP: Quantifying over Answer Sets. CoRR abs/1907.09559 (2019) - 2018
- [c123]Xudong Liu, Miroslaw Truszczynski:
Preference Learning and Optimization for Partial Lexicographic Preference Forests over Combinatorial Domains. FoIKS 2018: 284-302 - [c122]Zbigniew Lonc, Miroslaw Truszczynski:
Maximin Share Allocations on Cycles. IJCAI 2018: 410-416 - [c121]Jan Maly, Miroslaw Truszczynski, Stefan Woltran:
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? IJCAI 2018: 433-439 - [c120]Giovanni Amendola, Francesco Ricca, Mirek Truszczynski:
A Generator of Hard 2QBF Formulas and ASP Programs. KR 2018: 52-56 - [p2]Miroslaw Truszczynski:
An introduction to the stable and well-founded semantics of logic programs. Declarative Logic Programming 2018: 121-177 - [i42]Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs. CoRR abs/1802.03828 (2018) - 2017
- [c119]Giovanni Amendola, Francesco Ricca, Miroslaw Truszczynski:
Generating Hard Random Boolean Formulas and Disjunctive Logic Programs. IJCAI 2017: 532-538 - 2016
- [j70]Yuliya Lierler, Miroslaw Truszczynski:
On abstract modular inference systems and solvers. Artif. Intell. 236: 65-89 (2016) - [j69]Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski:
Answer Set Programming: An Introduction to the Special Issue. AI Mag. 37(3): 5-6 (2016) - [j68]Maurice Bruynooghe, Marc Denecker, Miroslaw Truszczynski:
First Order Logic with Inductive Definitions for Model-Based Problem Solving. AI Mag. 37(3): 69-80 (2016) - [j67]Zbigniew Lonc, Miroslaw Truszczynski:
Packing analogue of k-radius sequences. Eur. J. Comb. 57: 57-70 (2016) - [c118]Ying Zhu, Mirek Truszczynski:
Learning Importance of Preferences. GCAI 2016: 81-94 - [c117]Xudong Liu, Mirek Truszczynski:
Learning Partial Lexicographic Preference Trees and Forests over Multi-Valued Attributes. GCAI 2016: 314-328 - 2015
- [j66]Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On equivalence of infinitary formulas under the stable model semantics. Theory Pract. Log. Program. 15(1): 18-34 (2015) - [j65]Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran:
Dual-normal logic programs - the forgotten class. Theory Pract. Log. Program. 15(4-5): 495-510 (2015) - [c116]Yuliya Lierler, Miroslaw Truszczynski:
An Abstract View on Modularity in Knowledge Representation. AAAI 2015: 1532-1538 - [c115]Xudong Liu, Miroslaw Truszczynski:
Learning Partial Lexicographic Preference Trees over Combinatorial Domains. AAAI 2015: 1539-1545 - [c114]Xudong Liu, Miroslaw Truszczynski:
Reasoning with Preference Trees over Combinatorial Domains. ADT 2015: 19-34 - [c113]Ying Zhu, Miroslaw Truszczynski:
Manipulation and Bribery When Aggregating Ranked Preferences. ADT 2015: 86-102 - [c112]Thomas Eiter, Hannes Strass, Miroslaw Truszczynski, Stefan Woltran:
A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 1-16 - [c111]Wenbin Li, Jane Huffman Hayes, Miroslaw Truszczynski:
Towards More Efficient Requirements Formalization: A Study. REFSQ 2015: 181-197 - [e8]Thomas Eiter, Hannes Strass, Miroslaw Truszczynski, Stefan Woltran:
Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation - Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 9060, Springer 2015, ISBN 978-3-319-14725-3 [contents] - [e7]Francesco Calimeri, Giovambattista Ianni, Miroslaw Truszczynski:
Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings. Lecture Notes in Computer Science 9345, Springer 2015, ISBN 978-3-319-23263-8 [contents] - [i41]Johannes Klaus Fichte, Miroslaw Truszczynski, Stefan Woltran:
Dual-normal Logic Programs - the Forgotten Class. CoRR abs/1507.05388 (2015) - 2014
- [j64]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
A Measure of Arbitrariness in Abductive Explanations. Theory Pract. Log. Program. 14(4-5): 665-679 (2014) - [c110]Xudong Liu, Miroslaw Truszczynski:
Preference Trees: A Language for Representing and Reasoning about Qualitative Preferences. MPREF@AAAI 2014 - [c109]Ying Zhu, Miroslaw Truszczynski:
Manipulation and Bribery in Preference Reasoning under Pareto Principle. MPREF@AAAI 2014 - [c108]Yuliya Lierler, Miroslaw Truszczynski:
Abstract Modular Inference Systems and Solvers. PADL 2014: 49-64 - [c107]Wenbin Li, David Brown, Jane Huffman Hayes, Miroslaw Truszczynski:
Answer-Set Programming in Requirements Engineering. REFSQ 2014: 168-183 - [i40]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The Computational Complexity of Dominance and Consistency in CP-Nets. CoRR abs/1401.3453 (2014) - [i39]Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On Equivalence of Infinitary Formulas under the Stable Model Semantics. CoRR abs/1403.6689 (2014) - [i38]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
A Measure of Arbitrariness in Abductive Explanations. CoRR abs/1405.2494 (2014) - 2013
- [j63]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. J. Artif. Intell. Res. 47: 351-391 (2013) - [c106]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. AAAI 2013: 297-303 - [c105]Yuliya Lierler, Miroslaw Truszczynski:
Modular Answer Set Solving. AAAI (Late-Breaking Developments) 2013 - [c104]Xudong Liu, Miroslaw Truszczynski:
Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers. ADT 2013: 244-258 - [c103]Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics. LPNMR 2013: 387-394 - [c102]Artur Mikitiuk, Miroslaw Truszczynski:
Implementing Informal Semantics of ASP. LPNMR 2013: 433-438 - [c101]Ying Zhu, Miroslaw Truszczynski:
On Optimal Solutions of Answer Set Optimization Problems. LPNMR 2013: 556-568 - [c100]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
The View-Update Problem for Indefinite Databases. SEBD 2013: 95-102 - [i37]Yuliya Lierler, Miroslaw Truszczynski:
Abstract Modular Systems and Solvers. CoRR abs/1312.6151 (2013) - 2012
- [j62]Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski:
Constructions of asymptotically shortest k-radius sequences. J. Comb. Theory A 119(3): 731-746 (2012) - [c99]Miroslaw Truszczynski:
Connecting First-Order ASP and the Logic FO(ID) through Reducts. Correct Reasoning 2012: 543-559 - [c98]Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens:
A Tarskian Informal Semantics for Answer Set Programming. ICLP (Technical Communications) 2012: 277-289 - [c97]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
The View-Update Problem for Indefinite Databases. JELIA 2012: 134-146 - [c96]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. KR 2012 - [c95]Wenbin Li, Jane Huffman Hayes, Miroslaw Truszczynski:
Temporal Action Language (TAL): A Controlled Language for Consistency Checking of Natural Language Temporal Requirements - (Preliminary Results). NASA Formal Methods 2012: 162-167 - [c94]Yuliya Lierler, Shaden Smith, Miroslaw Truszczynski, Alex Westlund:
Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving. PADL 2012: 63-77 - [i36]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano:
The View-Update Problem for Indefinite Databases. CoRR abs/1205.4655 (2012) - 2011
- [j61]Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski:
Answer set programming at a glance. Commun. ACM 54(12): 92-103 (2011) - [j60]Zbigniew Lonc, Miroslaw Truszczynski:
On graph equivalences preserved under extensions. Discret. Math. 311(12): 966-977 (2011) - [j59]Yuliya Lierler, Miroslaw Truszczynski:
Transition systems for model generators - A unifying approach. Theory Pract. Log. Program. 11(4-5): 629-646 (2011) - [j58]Miroslaw Truszczynski:
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. Theory Pract. Log. Program. 11(6): 881-904 (2011) - [j57]Luciano Caroprese, Miroslaw Truszczynski:
Active integrity constraints and revision programming. Theory Pract. Log. Program. 11(6): 905-952 (2011) - [c93]Miroslaw Truszczynski:
Revisiting Epistemic Specifications. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 315-333 - [i35]Yuliya Lierler, Miroslaw Truszczynski:
Transition Systems for Model Generators - A Unifying Approach. CoRR abs/1105.0650 (2011) - [i34]Marc Denecker, Victor W. Marek, Miroslaw Truszczynski:
Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too. CoRR abs/1108.3278 (2011) - [i33]Miroslaw Truszczynski:
Revisiting Epistemic Specifications. CoRR abs/1108.3279 (2011) - [i32]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Origins of Answer-Set Programming - Some Background And Two Personal Accounts. CoRR abs/1108.3281 (2011) - [i31]Lengning Liu, Miroslaw Truszczynski:
Properties and Applications of Programs with Monotone and Convex Constraints. CoRR abs/1110.0023 (2011) - [i30]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran:
Strong Equivalence of Qualitative Optimization Problems. CoRR abs/1112.0791 (2011) - 2010
- [j56]Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski:
Logic programs with abstract constraint atoms: The role of computations. Artif. Intell. 174(3-4): 295-315 (2010) - [j55]Miroslaw Truszczynski:
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs. Artif. Intell. 174(16-17): 1285-1306 (2010) - [c92]Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran:
Representing Preferences Among Sets. AAAI 2010: 273-278 - [c91]Gayathri Namasivayam, Miroslaw Truszczynski:
Simple but Hard Mixed Horn Formulas. SAT 2010: 382-387 - [e6]Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski:
Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press 2010 [contents] - [i29]Miroslaw Truszczynski:
Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs. CoRR abs/1007.2816 (2010) - [i28]Luciano Caroprese, Miroslaw Truszczynski:
Active Integrity Constraints and Revision Programming. CoRR abs/1009.2270 (2010)
2000 – 2009
- 2009
- [j54]Miroslaw Truszczynski, Stefan Woltran:
Relativized hyperequivalence of logic programs for modular programming. Theory Pract. Log. Program. 9(6): 781-819 (2009) - [c90]Miroslaw Truszczynski:
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs. ICLP 2009: 175-189 - [c89]Gayathri Namasivayam, Miroslaw Truszczynski:
Simple Random Logic Programs. LPNMR 2009: 223-235 - [c88]Miroslaw Truszczynski:
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs. LPNMR 2009: 303-315 - [c87]Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser, Miroslaw Truszczynski:
The Second Answer Set Programming Competition. LPNMR 2009: 637-654 - [i27]Miroslaw Truszczynski, Stefan Woltran:
Relativized hyperequivalence of logic programs for modular programming. CoRR abs/0907.4128 (2009) - 2008
- [j53]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Preferences and Nonmonotonic Reasoning. AI Mag. 29(4): 69-78 (2008) - [j52]Michael Kaminski, Miroslaw Truszczynski:
Preface. Ann. Math. Artif. Intell. 53(1-4): 1-3 (2008) - [j51]Miroslaw Truszczynski:
My six encounters with Victor Marek - a personal account. Ann. Math. Artif. Intell. 53(1-4): 17-20 (2008) - [j50]Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of logic programs with respect to supported models. Ann. Math. Artif. Intell. 53(1-4): 331-365 (2008) - [j49]Zbigniew Lonc, Miroslaw Truszczynski:
On the number of minimal transversals in 3-uniform hypergraphs. Discret. Math. 308(16): 3668-3687 (2008) - [j48]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The Computational Complexity of Dominance and Consistency in CP-Nets. J. Artif. Intell. Res. 33: 403-432 (2008) - [j47]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms. Theory Pract. Log. Program. 8(2): 167-199 (2008) - [j46]Victor W. Marek, Miroslaw Truszczynski:
Approximation Schemes in Logic and Artificial Intelligence. Trans. Rough Sets 9: 135-144 (2008) - [c86]Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of Logic Programs with Respect to Supported Models. AAAI 2008: 560-565 - [c85]Luciano Caroprese, Miroslaw Truszczynski:
Declarative Semantics for Active Integrity Constraints. ICLP 2008: 269-283 - [c84]Miroslaw Truszczynski, Stefan Woltran:
Relativized Hyperequivalence of Logic Programs for Modular Programming. ICLP 2008: 576-590 - [c83]Miroslaw Truszczynski, Stefan Woltran:
Hyperequivalence of Programs and Operators. ISAIM 2008 - [c82]Luciano Caroprese, Miroslaw Truszczynski:
Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. JELIA 2008: 100-112 - [r1]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Nonmonotonic Reasoning. Handbook of Knowledge Representation 2008: 239-284 - 2007
- [j45]Lengning Liu, Miroslaw Truszczynski:
Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques. Constraints An Int. J. 12(3): 345-369 (2007) - [c81]Miroslaw Truszczynski:
The Modal Logic S4F, the Default Logic, and the Logic Here-and-There. AAAI 2007: 508-514 - [c80]Artur Mikitiuk, Eric Moseley, Miroslaw Truszczynski:
Towards Debugging of Answer-Set Programs in the Language PSpb. IC-AI 2007: 635-640 - [c79]Miroslaw Truszczynski:
Logic Programming for Knowledge Representation. ICLP 2007: 76-88 - [c78]Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski:
Logic Programs with Abstract Constraint Atoms: The Role of Computations. ICLP 2007: 286-301 - [c77]Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub, Miroslaw Truszczynski:
The First Answer Set Programming System Competition. LPNMR 2007: 3-17 - [c76]Gayathri Namasivayam, Miroslaw Truszczynski:
An Smodels System with Limited Lookahead Computation. LPNMR 2007: 278-283 - [c75]Victor W. Marek, Miroslaw Truszczynski:
Rough Sets and Approximation Schemes. RSEISP 2007: 22-28 - 2006
- [j44]Deborah East, Mikhail Iakhiaev, Artur Mikitiuk, Miroslaw Truszczynski:
Tools for modeling and solving search problems. AI Commun. 19(4): 301-312 (2006) - [j43]Miroslaw Truszczynski:
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach. Ann. Math. Artif. Intell. 48(3-4): 245-265 (2006) - [j42]Lengning Liu, Miroslaw Truszczynski:
Properties and Applications of Programs with Monotone and Convex Constraints. J. Artif. Intell. Res. 27: 299-334 (2006) - [j41]Deborah East, Miroslaw Truszczynski:
Predicate-calculus-based logics for modeling and solving search problems. ACM Trans. Comput. Log. 7(1): 38-83 (2006) - [j40]Zbigniew Lonc, Miroslaw Truszczynski:
Computing minimal models, stable models and answer sets. Theory Pract. Log. Program. 6(4): 395-449 (2006) - [c74]Lengning Liu, Miroslaw Truszczynski:
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints. AAAI 2006: 98-103 - [c73]