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]Miroslaw Truszczynski:
Nonmonotonic Logics and Their Algebraic Foundations. CSL 2006: 58-71 - [c72]Miroslaw Truszczynski, V. Wiktor Marek, Raphael A. Finkel:
Generating Cellular Puzzles with Logic Programs. IC-AI 2006: 403-407 - [c71]Mirek Truszczynski:
Strong Equivalence of Nonmonotonic Theories -- an Algebraic Approach. AI&M 2006 - [c70]Miroslaw Truszczynski:
Strong and Uniform Equivalence of Nonmonotonic Theories - An Algebraic Approach. KR 2006: 389-399 - [e5]Sandro Etalle, Miroslaw Truszczynski:
Logic Programming, 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings. Lecture Notes in Computer Science 4079, Springer 2006, ISBN 3-540-36635-0 [contents] - [i26]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic programs with monotone abstract constraint atoms. CoRR abs/cs/0608103 (2006) - 2005
- [c69]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Prioritized Component Systems. AAAI 2005: 596-601 - [c68]Lengning Liu, Miroslaw Truszczynski:
Properties of Programs with Monotone and Convex Constraints. AAAI 2005: 701-706 - [c67]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The computational complexity of dominance and consistency in CP-nets. IJCAI 2005: 144-149 - [c66]Victor W. Marek, Inna Pivkina, Miroslaw Truszczynski:
Approximating Answer Sets of Unitary Lifschitz-Woo Programs. LPNMR 2005: 66-78 - [c65]Lengning Liu, Miroslaw Truszczynski:
Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers. LPNMR 2005: 410-415 - [e4]Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski:
Nonmonotonic Reasoning, Answer Set Programming and Constraints, 24.-29. April 2005. Dagstuhl Seminar Proceedings 05171, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005 [contents] - [i25]Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski:
05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 - [i24]Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, Joost Vennekens:
05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints. Nonmonotonic Reasoning, Answer Set Programming and Constraints 2005 - [i23]Zbigniew Lonc, Miroslaw Truszczynski:
Computing minimal models, stable models and answer sets. CoRR abs/cs/0506104 (2005) - 2004
- [j39]Michael R. Dransfield, Lengning Liu, Victor W. Marek, Miroslaw Truszczynski:
Satisfiability and Computing van der Waerden Numbers. Electron. J. Comb. 11(1) (2004) - [j38]Marc Denecker, Victor W. Marek, Miroslaw Truszczynski:
Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput. 192(1): 84-121 (2004) - [j37]Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski:
Constraint Lingo: towards high-level constraint programming. Softw. Pract. Exp. 34(15): 1481-1504 (2004) - [j36]Zbigniew Lonc, Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates. Theory Pract. Log. Program. 4(1-2): 193-231 (2004) - [j35]Miroslaw Truszczynski:
Book review: Knowledge Representation, Reasoning and Declarative Problem Solving by Chitta Baral, Cambridge University press, 2003, ISBN 0-521-81802-8. Theory Pract. Log. Program. 4(1-2): 237-239 (2004) - [c64]Victor W. Marek, Miroslaw Truszczynski:
Logic Programs with Abstract Constraint Atoms. AAAI 2004: 86-91 - [c63]Hemantha Ponnuru, Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski:
Automatic Generation of English-language Steps in Puzzle Solving. IC-AI 2004: 437-442 - [c62]Paul Borchert, Christian Anger, Torsten Schaub, Miroslaw Truszczynski:
Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. LPNMR 2004: 3-7 - [c61]V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic Programs With Monotone Cardinality Atoms. LPNMR 2004: 154-166 - [c60]Lengning Liu, Miroslaw Truszczynski:
WSAT(CC) - A Fast Local-Search ASP Solver. LPNMR 2004: 351-355 - [c59]Nikolay Pelov, Miroslaw Truszczynski:
Semantics of disjunctive programs with monotone aggregates - an operator-based approach. NMR 2004: 327-334 - [c58]Lengning Liu, Miroslaw Truszczynski:
Local Search with Bootstrapping. SAT 2004 - 2003
- [j34]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
Uniform semantic treatment of default and autoepistemic logics. Artif. Intell. 143(1): 79-122 (2003) - [j33]Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs. ACM Trans. Comput. Log. 4(1): 91-119 (2003) - [c57]Lengning Liu, Miroslaw Truszczynski:
Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints. CP 2003: 495-509 - [c56]Zbigniew Lonc, Miroslaw Truszczynski:
Computing Minimal Models, Stable Models, and Answer Sets. ICLP 2003: 209-223 - [c55]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski:
Answer Set Optimization. IJCAI 2003: 867-872 - [c54]Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski:
Satisfiability and Computing van der Waerden Numbers. SAT 2003: 1-13 - [i22]Lengning Liu, Miroslaw Truszczynski:
Local-search techniques for propositional logic extended with cardinality constraints. CoRR cs.AI/0310061 (2003) - [i21]Lengning Liu, Miroslaw Truszczynski:
WSAT(cc) - a fast local-search ASP solver. CoRR cs.AI/0310062 (2003) - [i20]V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski:
Logic programs with monotone cardinality atoms. CoRR cs.LO/0310063 (2003) - [i19]Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski:
Satisfiability and computing van der Waerden numbers. CoRR cs.LO/0310064 (2003) - 2002
- [j32]V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski:
Annotated revision programs. Artif. Intell. 138(1-2): 149-180 (2002) - [j31]Miroslaw Truszczynski:
Computing large and small stable models. Theory Pract. Log. Program. 2(1): 1-23 (2002) - [c53]Zbigniew Lonc, Miroslaw Truszczynski:
Computing Stable Models: Worst-Case Performance Estimates. ICLP 2002: 347-362 - [c52]Raphael A. Finkel, V. Wiktor Marek, Miroslaw Truszczynski:
Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems. JELIA 2002: 513-516 - [c51]Deborah East, Miroslaw Truszczynski:
The aspps System. JELIA 2002: 533-536 - [c50]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
Ultimate Approximations in Nonmonotonic Knowledge Representation Systems. KR 2002: 177-190 - [i18]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
Ultimate approximations in nonmonotonic knowledge representation systems. CoRR cs.AI/0205014 (2002) - [i17]Zbigniew Lonc, Miroslaw Truszczynski:
Computing stable models: worst-case performance estimates. CoRR cs.LO/0205013 (2002) - [i16]Deborah East, Miroslaw Truszczynski:
Propositional satisfiability in declarative programming. CoRR cs.LO/0211033 (2002) - 2001
- [j30]Joeri Engelfriet, V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski:
Default logic and specification of nonmonotonic reasoning. J. Exp. Theor. Artif. Intell. 13(2): 99-112 (2001) - [j29]Zbigniew Lonc, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. Theory Pract. Log. Program. 1(5): 591-609 (2001) - [c49]Deborah East, Miroslaw Truszczynski:
More on Wire Routing with ASP. Answer Set Programming 2001 - [c48]Raphael A. Finkel, Victor W. Marek, Neil Moore, Miroslaw Truszczynski:
Computing stable models in parallel. Answer Set Programming 2001 - [c47]Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski:
Tabular Constraint-Satisfaction Problems and Answer Set Programming. Answer Set Programming 2001 - [c46]Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-Parameter Complexity of Semantics for Logic Programs. ICLP 2001: 197-211 - [c45]Deborah East, Miroslaw Truszczynski:
Propositional Satisfiability in Answer-Set Programming. KI/ÖGAI 2001: 138-153 - [c44]Deborah East, Miroslaw Truszczynski:
aspps - An Implementation of Answer-Set Programming with Propositional Schemata. LPNMR 2001: 402-405 - [e3]Thomas Eiter, Wolfgang Faber, Miroslaw Truszczynski:
Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings. Lecture Notes in Computer Science 2173, Springer 2001, ISBN 3-540-42593-4 [contents] - [i15]V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski:
Annotated revision programs. CoRR cs.AI/0107026 (2001) - [i14]Deborah East, Miroslaw Truszczynski:
Propositional satisfiability in answer-set programming. CoRR cs.AI/0107028 (2001) - [i13]Deborah East, Miroslaw Truszczynski:
aspps - an implementation of answer-set programming with propositional schemata. CoRR cs.AI/0107029 (2001) - [i12]Zbigniew Lonc, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. CoRR cs.LO/0101014 (2001) - [i11]Zbigniew Lonc, Miroslaw Truszczynski:
Fixed-parameter complexity of semantics for logic programs. CoRR cs.LO/0107027 (2001) - 2000
- [c43]Deborah East, Miroslaw Truszczynski:
DATALOG with Constraints - An Answer-Set Programming System. AAAI/IAAI 2000: 163-168 - [c42]Zbigniew Lonc, Miroslaw Truszczynski:
On the Problem of Computing the Well-Founded Semantics. Computational Logic 2000: 673-687 - [c41]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
Uniform semantic treatment of default and autoepistemic logic. KR 2000: 74-84 - [i10]Marc Denecker, Victor W. Marek, Miroslaw Truszczynski:
Uniform semantic treatment of default and autoepistemic logics. CoRR cs.AI/0002002 (2000) - [i9]Deborah East, Miroslaw Truszczynski:
On the accuracy and running time of GSAT. CoRR cs.AI/0002003 (2000) - [i8]Deborah East, Miroslaw Truszczynski:
dcs: An Implementation of DATALOG with Constraints. CoRR cs.AI/0003061 (2000) - [i7]Chitta Baral, Miroslaw Truszczynski:
Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, NMR'2000. CoRR cs.AI/0003073 (2000) - [i6]Deborah East, Miroslaw Truszczynski:
DATALOG with constraints - an answer-set programming system. CoRR cs.AI/0003077 (2000) - [i5]Miroslaw Truszczynski:
Computing large and small stable models. CoRR cs.LO/0002001 (2000)
1990 – 1999
- 1999
- [j28]Pawel Cholewinski, V. Wiktor Marek, Miroslaw Truszczynski, Artur Mikitiuk:
Computing with Default Logic. Artif. Intell. 112(1-2): 105-146 (1999) - [j27]V. Wiktor Marek, Miroslaw Truszczynski:
Contributions to the Theory of Rough Sets. Fundam. Informaticae 39(4): 389-409 (1999) - [j26]Pawel Cholewinski, Miroslaw Truszczynski:
Extremal Problems in Logic Programming and Stable Model Computation. J. Log. Program. 38(2): 219-242 (1999) - [c40]Christine R. Leverenz, Miroslaw Truszczynski:
The rectilinear Steiner tree problem: algorithms and examples using permutations of the terminal set. ACM Southeast Regional Conference 1999 - [c39]Deborah East, Miroslaw Truszczynski:
On the Accuracy and Running Time of GSAT. EPIA 1999: 49-61 - [c38]Miroslaw Truszczynski:
Computing Large and Small Stable Models. ICLP 1999: 169-183 - [c37]V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski:
Annotated Revision Programs. LPNMR 1999: 49-62 - [p1]Victor W. Marek, Miroslaw Truszczynski:
Stable Models and an Alternative Logic Programming Paradigm. The Logic Programming Paradigm 1999: 375-398 - [e2]Krzysztof R. Apt, Victor W. Marek, Mirek Truszczynski, David Scott Warren:
The Logic Programming Paradigm - A 25-Year Perspective. Artificial Intelligence, Springer 1999, ISBN 978-3-642-64249-4 [contents] - [i4]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
Fixpoint 3-valued semantics for autoepistemic logic. CoRR cs.LO/9901003 (1999) - [i3]Pawel Cholewinski, Miroslaw Truszczynski:
Extremal problems in logic programming and stable model computation. CoRR cs.LO/9901012 (1999) - [i2]V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski:
Representation Theory for Default Logic. CoRR cs.LO/9901016 (1999) - 1998
- [j25]V. Wiktor Marek, Miroslaw Truszczynski:
Revision Programming. Theor. Comput. Sci. 190(2): 241-277 (1998) - [c36]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski:
Fixpoint 3-Valued Semantics for Autoepistemic Logic. AAAI/IAAI 1998: 840-845 - [c35]Walton Sumner, Miroslaw Truszczynski, Victor W. Marek:
Simulating patients with Parallel Health State Networks. AMIA 1998 - [c34]V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski:
Revision Programming = Logic Programming + Integrity Constraints. CSL 1998: 73-89 - [c33]V. Wiktor Marek, Miroslaw Truszczynski:
Rough Sets - What Are They About? Rough Sets and Current Trends in Computing 1998: 24 - [e1]Grigoris Antoniou, Aditya Ghose, Miroslaw Truszczynski:
Learning and Reasoning with Complex Representations, PRICAI'96 Workshops on Reasoning with Incomplete and Changing Information and on Inducing Complex Representations, Cairns, Australia, August 26-30, 1996, Selected Papers. Lecture Notes in Computer Science 1359, Springer 1998, ISBN 3-540-64413-X [contents] - [i1]Victor W. Marek, Miroslaw Truszczynski:
Stable models and an alternative logic programming paradigm. CoRR cs.LO/9809032 (1998) - 1997
- [j24]V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski:
Representation Theory for Default Logic. Ann. Math. Artif. Intell. 21(2-4): 343-358 (1997) - [j23]Andrzej Rucinski, Miroslaw Truszczynski:
A note on local colorings of graphs. Discret. Math. 164(1-3): 251-255 (1997) - [c32]Joseph D. Oldham, V. Wiktor Marek, Miroslaw Truszczynski:
Intelligent Computation of Presentation Documents. ISMIS 1997: 560-569 - [c31]Miroslaw Truszczynski:
Automated Reasoning with Non-Monotonic Logics (Abstract). LPNMR 1997: 112-114 - 1996
- [j22]Georg Gottlob, Miroslaw Truszczynski:
Approximating the Stable Model Semantics is Hard. Fundam. Informaticae 28(1-2): 123-128 (1996) - [j21]Grigori Schwarz, Miroslaw Truszczynski:
Nonmonotonic Reasoning is Sometimes Simpler! J. Log. Comput. 6(2): 295-308 (1996) - [c30]Pawel Cholewinski, Miroslaw Truszczynski:
Extremal Problems in Logic Programming and Stable Model Computation. JICSLP 1996: 408-422 - [c29]Joeri Engelfriet, V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski:
Infinitary Default Logic for Specification of Nonmonotonic Reasoning. JELIA 1996: 224-236 - [c28]Pawel Cholewinski, V. Wiktor Marek, Miroslaw Truszczynski:
Default Reasoning System DeReS. KR 1996: 518-528 - 1995
- [j20]V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski:
Complexity of Computing with Extended Propositional Logic Programs. Ann. Math. Artif. Intell. 15(3-4): 357-378 (1995) - [c27]V. Wiktor Marek, Miroslaw Truszczynski:
Revision Programming, Database Updates and Integrity Constraints. ICDT 1995: 368-382 - [c26]Pawel Cholewinski, V. Wiktor Marek, Artur Mikitiuk, Miroslaw Truszczynski:
Experimenting with Nonmonotonic Reasoning. ICLP 1995: 267-281 - [c25]Artur Mikitiuk, Miroslaw Truszczynski:
Constrained and Rational Default Logics. IJCAI 1995: 1509-1517 - [c24]Artur Mikitiuk, Miroslaw Truszczynski:
Skeptical Rational Extensions. LPNMR 1995: 259-272 - [c23]William Brooks, V. Wiktor Marek, Miroslaw Truszczynski:
Algorithms for Maintaining Authorization Bases. OOIS 1995: 99-110 - 1994
- [j19]Grigori Schwarz, Miroslaw Truszczynski:
Minimal Knowledge Problem: A New Approach. Artif. Intell. 67(1): 113-141 (1994) - [c22]V. Wiktor Marek, Miroslaw Truszczynski:
Revision Specifications by Means of Programs. JELIA 1994: 122-136 - 1993
- [b1]Victor W. Marek, Miroslaw Truszczynski:
Nonmonotonic logic - context-dependent reasoning. Artificial intelligence, Springer 1993, ISBN 978-3-540-56448-5, pp. I-XII, 1-417 - [j18]V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Truszczynski:
Modal Nonmonotonic Logics: Ranges, Characterization, Computation. J. ACM 40(4): 963-990 (1993) - [c21]Grigori Schwarz, Miroslaw Truszczynski:
Subnormal Modal Logics for Knowledge Representation. AAAI 1993: 438-443 - [c20]Grigori Schwarz, Miroslaw Truszczynski:
Nonmonotonic Reasoning is Sometimes Simpler. Kurt Gödel Colloquium 1993: 313-324 - [c19]V. Wiktor Marek, Miroslaw Truszczynski:
Reflective Autoepistemic Logic and Logic Programming. LPNMR 1993: 115-131 - [c18]Artur Mikitiuk, Miroslaw Truszczynski:
Rational Default Logic and Disjunctive Logic Programming. LPNMR 1993: 283-299 - 1992
- [j17]Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski:
Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discret. Appl. Math. 36(2): 141-152 (1992) - [j16]Miroslaw Truszczynski, Zsolt Tuza:
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. Discret. Math. 103(3): 301-312 (1992) - [j15]V. Wiktor Marek, Miroslaw Truszczynski:
More on modal aspects of default logic. Fundam. Informaticae 17(1-2): 99-116 (1992) - [j14]Miroslaw Truszczynski:
Generalized local colorings of graphs. J. Comb. Theory B 54(2): 178-188 (1992) - [j13]Melvin Fitting, V. Wiktor Marek, Miroslaw Truszczynski:
The Pure Logic of Necessitation. J. Log. Comput. 2(3): 349-373 (1992) - [c17]Dee Parks, Miroslaw Truszczynski:
An algorithm for embedding a class of non-even routing problems in even routing problems. Great Lakes Symposium on VLSI 1992: 152-158 - [c16]V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski:
Complexity of Computing with Extended Propositional Logic Programs. Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 93-102 - [c15]Grigori Schwarz, Miroslaw Truszczynski:
Modal Logic S4F and The Minimal Knowledge Paradigm. TARK 1992: 184-198 - 1991
- [j12]Phyllis Z. Chinn, R. Bruce Richter, Miroslaw Truszczynski:
Primal graphs with small degrees. Discret. Math. 87(3): 237-248 (1991) - [j11]Miroslaw Truszczynski, Zsolt Tuza:
Asymptotic results on saturated graphs. Discret. Math. 87(3): 309-314 (1991) - [j10]Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza:
Decompositions of regular bipartite graphs. Discret. Math. 89(1): 17-27 (1991) - [j9]Miroslaw Truszczynski:
Decompositions of graphs into forests with bounded maximum degree. Discret. Math. 98(3): 207-222 (1991) - [j8]Miroslaw Truszczynski:
Modal nonmonotonic logic with restricted application of the negation as failure to prove rule. Fundam. Informaticae 14(3): 355-366 (1991) - [j7]V. Wiktor Marek, Miroslaw Truszczynski:
Autoepistemic Logic. J. ACM 38(3): 588-619 (1991) - [c14]Dee Parks, Miroslaw Truszczynski:
Routing non-convex grids without holes. Great Lakes Symposium on VLSI 1991: 157-162 - [c13]Miroslaw Truszczynski:
Modal Interpretations of Default Logic. IJCAI 1991: 393-398 - [c12]Michael Gelfond, Halina Przymusinska, Vladimir Lifschitz, Miroslaw Truszczynski:
Disjective Defaults. KR 1991: 230-237 - [c11]V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Truszczynski:
Modal Nonmonotonic Logics: Ranges, Characterization, Computation. KR 1991: 395-404 - [c10]V. Wiktor Marek, Miroslaw Truszczynski:
Computing Intersection of Autoepistemic Expansions. LPNMR 1991: 37-50 - [c9]Miroslaw Truszczynski:
Embedding Default Logic into Modal Nonmonotonic Logics. LPNMR 1991: 151-165 - [c8]V. Wiktor Marek, Miroslaw Truszczynski:
Normal Form Results for Default Logic. Nonmonotonic and Inductive Logic 1991: 270-283 - 1990
- [j6]V. Wiktor Marek, Miroslaw Truszczynski:
Modal Logic for Default Reasoning. Ann. Math. Artif. Intell. 1: 275-302 (1990) - [c7]Miroslaw Truszczynski:
Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule. LPNMR 1990: 150-169 - [c6]V. Wiktor Marek, Grigori Schwarz, Miroslaw Truszczynski:
Ranges of Strong Modal Nonmonotonic Logics. Nonmonotonic and Inductive Logic 1990: 85-99
1980 – 1989
- 1989
- [c5]V. Wiktor Marek, Miroslaw Truszczynski:
Relating Autoepistemic and Default Logics. KR 1989: 276-288 - [c4]V. Wiktor Marek, Miroslaw Truszczynski:
Stable Semantics for Logic Programs and Default Theories. NACLP 1989: 243-256 - 1987
- [j5]Miroslaw Truszczynski, Zsolt Tuza:
Linear upper bounds for local Ramsey numbers. Graphs Comb. 3(1): 67-73 (1987) - 1985
- [j4]Miroslaw Truszczynski:
Note on the decomposition of lambdaKm, n (lambdaKm, n*) into paths. Discret. Math. 55(1): 89-96 (1985) - 1981
- [j3]Miroslaw Truszczynski:
Algorithmic aspects of the attribute set minimization problem. Fundam. Informaticae 4(2): 419-426 (1981) - [c3]Miroslaw Truszczynski:
On Admissible Families of Sets. FODO 1981: 201-221 - [c2]Cezary Iwanski, Miroslaw Truszczynski:
Optimal F-Graphs for Balanced Families of Sets. FODO 1981: 223-246 - [c1]Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski:
Optimal F-Graphs for the Family of all K-Subsets of an N-Set. FODO 1981: 247-270 - 1980
- [j2]Miroslaw Truszczynski:
An algorithm of finding an acyclic f-graph for a family od sets. Fundam. Informaticae 3(3): 379-396 (1980) - [j1]Miroslaw Truszczynski:
Once More on Storage for Consecutive Retrieval. Inf. Process. Lett. 10(1): 21-24 (1980)
Coauthor Index
Victor W. Marek
aka: V. Wiktor Marek
aka: V. Wiktor Marek
[i34] [i32] [j47] [j46] [c75] [c72] [i26] [c66] [j39] [j38] [j37] [c64] [c63] [c61] [j34] [c54] [i20] [i19] [j32] [c52] [c50] [i18] [j30] [c48] [c47] [i15] [c41] [i10] [j28] [j27] [c37] [p1] [e2] [i4] [i2] [j25] [c36] [c35] [c34] [c33] [i1] [j24] [c32] [c29] [c28] [j20] [c27] [c26] [c23] [c22] [b1] [j18] [c19] [j15] [j13] [c16] [j7] [c11] [c10] [c8] [j6] [c6] [c5] [c4]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
