Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Miroslaw Truszczynski
2010 – today
- 2013
[j63]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran: Strong Equivalence of Qualitative Optimization Problems. J. Artif. Intell. Res. (JAIR) 47: 351-391 (2013)- [c98]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran: Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. AAAI 2013
- 2012
- [j62]Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski: Constructions of asymptotically shortest k-radius sequences. J. Comb. Theory, Ser. A 119(3): 731-746 (2012)
- [c97]Miroslaw Truszczynski: Connecting First-Order ASP and the Logic FO(ID) through Reducts. Correct Reasoning 2012: 543-559
- [c96]Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens: A Tarskian Informal Semantics for Answer Set Programming. ICLP (Technical Communications) 2012: 277-289
- [c95]Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski, Ester Zumpano: The View-Update Problem for Indefinite Databases. JELIA 2012: 134-146
- [c94]Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran: Strong Equivalence of Qualitative Optimization Problems. KR 2012
- [c93]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
- [c92]Yuliya Lierler, Shaden Smith, Miroslaw Truszczynski, Alex Westlund: Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving. PADL 2012: 63-77
- [i34]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. Discrete Mathematics 311(12): 966-977 (2011)
- [j59]Yuliya Lierler, Miroslaw Truszczynski: Transition systems for model generators - A unifying approach. TPLP 11(4-5): 629-646 (2011)
- [j58]Miroslaw Truszczynski: Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs. TPLP 11(6): 881-904 (2011)
- [j57]Luciano Caroprese, Miroslaw Truszczynski: Active integrity constraints and revision programming. TPLP 11(6): 905-952 (2011)
- [c91]Miroslaw Truszczynski: Revisiting Epistemic Specifications. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 315-333
- [i33]Yuliya Lierler, Miroslaw Truszczynski: Transition Systems for Model Generators - A Unifying Approach. CoRR abs/1105.0650 (2011)
- [i32]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)
- [i31]
- [i30]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski: Origins of Answer-Set Programming - Some Background And Two Personal Accounts. CoRR abs/1108.3281 (2011)
- [i29]Lengning Liu, Miroslaw Truszczynski: Properties and Applications of Programs with Monotone and Convex Constraints. CoRR abs/1110.0023 (2011)
- [i28]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)
- [c90]Gerhard Brewka, Miroslaw Truszczynski, Stefan Woltran: Representing Preferences Among Sets. AAAI 2010
- [c89]
- [e5]Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski (Eds.): Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press 2010
- [i27]Miroslaw Truszczynski: Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs. CoRR abs/1007.2816 (2010)
- [i26]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. TPLP 9(6): 781-819 (2009)
- [c88]Miroslaw Truszczynski: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs. ICLP 2009: 175-189
- [c87]
- [c86]Miroslaw Truszczynski: Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs. LPNMR 2009: 303-315
- [c85]Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser, Miroslaw Truszczynski: The Second Answer Set Programming Competition. LPNMR 2009: 637-654
- [i25]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 Magazine 29(4): 69-78 (2008)
- [j52]
- [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. Discrete Mathematics 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. (JAIR) 33: 403-432 (2008)
- [j47]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic programs with monotone abstract constraint atoms. TPLP 8(2): 167-199 (2008)
- [j46]Victor W. Marek, Miroslaw Truszczynski: Approximation Schemes in Logic and Artificial Intelligence. T. Rough Sets 9: 135-144 (2008)
- [c84]Miroslaw Truszczynski, Stefan Woltran: Hyperequivalence of Logic Programs with Respect to Supported Models. AAAI 2008: 560-565
- [c83]Luciano Caroprese, Miroslaw Truszczynski: Declarative Semantics for Active Integrity Constraints. ICLP 2008: 269-283
- [c82]Miroslaw Truszczynski, Stefan Woltran: Relativized Hyperequivalence of Logic Programs for Modular Programming. ICLP 2008: 576-590
- [c81]
- [c80]Luciano Caroprese, Miroslaw Truszczynski: Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. JELIA 2008: 100-112
- 2007
- [j45]Lengning Liu, Miroslaw Truszczynski: Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques. Constraints 12(3): 345-369 (2007)
- [c79]Miroslaw Truszczynski: The Modal Logic S4F, the Default Logic, and the Logic Here-and-There. AAAI 2007: 508-514
- [c78]Artur Mikitiuk, Eric Moseley, Miroslaw Truszczynski: Towards Debugging of Answer-Set Programs in the Language PSpb. IC-AI 2007: 635-640
- [c77]
- [c76]Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski: Logic Programs with Abstract Constraint Atoms: The Role of Computations. ICLP 2007: 286-301
- [c75]Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub, Miroslaw Truszczynski: The First Answer Set Programming System Competition. LPNMR 2007: 3-17
- [c74]Gayathri Namasivayam, Miroslaw Truszczynski: An Smodels System with Limited Lookahead Computation. LPNMR 2007: 278-283
- [c73]
- 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. (JAIR) 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. TPLP 6(4): 395-449 (2006)
- [c72]Lengning Liu, Miroslaw Truszczynski: Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints. AAAI 2006: 98-103
- [c71]
- [c70]Miroslaw Truszczynski, V. Wiktor Marek, Raphael A. Finkel: Generating Cellular Puzzles with Logic Programs. IC-AI 2006: 403-407
- [c69]Miroslaw Truszczynski: Strong and Uniform Equivalence of Nonmonotonic Theories - An Algebraic Approach. KR 2006: 389-399
- [e4]Sandro Etalle, Miroslaw Truszczynski (Eds.): 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
- [i24]Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic programs with monotone abstract constraint atoms. CoRR abs/cs/0608103 (2006)
- 2005
- [c68]Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski: Prioritized Component Systems. AAAI 2005: 596-601
- [c67]Lengning Liu, Miroslaw Truszczynski: Properties of Programs with Monotone and Convex Constraints. AAAI 2005: 701-706
- [c66]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
- [c65]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
- [c64]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson: The computational complexity of dominance and consistency in CP-nets. IJCAI 2005: 144-149
- [c63]Victor W. Marek, Inna Pivkina, Miroslaw Truszczynski: Approximating Answer Sets of Unitary Lifschitz-Woo Programs. LPNMR 2005: 66-78
- [c62]Lengning Liu, Miroslaw Truszczynski: Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers. LPNMR 2005: 410-415
- [e3]Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski (Eds.): 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
- [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. Electr. 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. Exper. 34(15): 1481-1504 (2004)
- [j36]Zbigniew Lonc, Miroslaw Truszczynski: Computing stable models: worst-case performance estimates. TPLP 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. TPLP 4(1-2): 237-239 (2004)
- [c61]Victor W. Marek, Miroslaw Truszczynski: Logic Programs with Abstract Constraint Atoms. AAAI 2004: 86-91
- [c60]Hemantha Ponnuru, Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski: Automatic Generation of English-language Steps in Puzzle Solving. IC-AI 2004: 437-442
- [c59]Paul Borchert, Christian Anger, Torsten Schaub, Miroslaw Truszczynski: Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. LPNMR 2004: 3-7
- [c58]V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski: Logic Programs With Monotone Cardinality Atoms. LPNMR 2004: 154-166
- [c57]
- [c56]Nikolay Pelov, Miroslaw Truszczynski: Semantics of disjunctive programs with monotone aggregates - an operator-based approach. NMR 2004: 327-334
- [c55]
- 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)
- [c54]Lengning Liu, Miroslaw Truszczynski: Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints. CP 2003: 495-509
- [c53]Zbigniew Lonc, Miroslaw Truszczynski: Computing Minimal Models, Stable Models, and Answer Sets. ICLP 2003: 209-223
- [c52]
- [c51]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]
- [c50]Zbigniew Lonc, Miroslaw Truszczynski: Computing Stable Models: Worst-Case Performance Estimates. ICLP 2002: 347-362
- [c49]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
- [c48]
- [c47]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. TPLP 1(5): 591-609 (2001)
- [c46]
- [c45]Raphael A. Finkel, Victor W. Marek, Neil Moore, Miroslaw Truszczynski: Computing stable models in parallel. Answer Set Programming 2001
- [c44]Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski: Tabular Constraint-Satisfaction Problems and Answer Set Programming. Answer Set Programming 2001
- [c43]Zbigniew Lonc, Miroslaw Truszczynski: Fixed-Parameter Complexity of Semantics for Logic Programs. ICLP 2001: 197-211
- [c42]Deborah East, Miroslaw Truszczynski: Propositional Satisfiability in Answer-Set Programming. KI/ÖGAI 2001: 138-153
- [c41]Deborah East, Miroslaw Truszczynski: aspps - An Implementation of Answer-Set Programming with Propositional Schemata. LPNMR 2001: 402-405
- [e2]Thomas Eiter, Wolfgang Faber, Miroslaw Truszczynski (Eds.): 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
- [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
- [c40]Deborah East, Miroslaw Truszczynski: DATALOG with Constraints - An Answer-Set Programming System. AAAI/IAAI 2000: 163-168
- [c39]Zbigniew Lonc, Miroslaw Truszczynski: On the Problem of Computing the Well-Founded Semantics. Computational Logic 2000: 673-687
- [c38]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]
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. Inform. 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)
- [c37]Christine R. Leverenz, Miroslaw Truszczynski: The rectilinear Steiner tree problem: algorithms and examples using permutations of the terminal set. ACM Southeast Regional Conference 1999
- [c36]
- [c35]
- [c34]V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski: Annotated Revision Programs. LPNMR 1999: 49-62
- [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)
- [c33]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Fixpoint 3-Valued Semantics for Autoepistemic Logic. AAAI/IAAI 1998: 840-845
- [c32]V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski: Revision Programming = Logic Programming + Integrity Constraints. CSL 1998: 73-89
- [c31]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 (Eds.): 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
- [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. Discrete Mathematics 164(1-3): 251-255 (1997)
- [c30]Joseph D. Oldham, V. Wiktor Marek, Miroslaw Truszczynski: Intelligent Computation of Presentation Documents. ISMIS 1997: 560-569
- [c29]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. Inform. 28(1-2): 123-128 (1996)
- [j21]Grigori Schwarz, Miroslaw Truszczynski: Nonmonotonic Reasoning is Sometimes Simpler! J. Log. Comput. 6(2): 295-308 (1996)
- [c28]Pawel Cholewinski, Miroslaw Truszczynski: Extremal Problems in Logic Programming and Stable Model Computation. JICSLP 1996: 408-422
- [c27]Joeri Engelfriet, V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski: Infinitary Default Logic for Specification of Nonmonotonic Reasoning. JELIA 1996: 224-236
- [c26]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)
- [c25]V. Wiktor Marek, Miroslaw Truszczynski: Revision Programming, Database Updates and Integrity Constraints. ICDT 1995: 368-382
- [c24]Pawel Cholewinski, V. Wiktor Marek, Artur Mikitiuk, Miroslaw Truszczynski: Experimenting with Nonmonotonic Reasoning. ICLP 1995: 267-281
- [c23]Artur Mikitiuk, Miroslaw Truszczynski: Constrained and Rational Default Logics. IJCAI 1995: 1509-1517
- [c22]
- [c21]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)
- [c20]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)
- [c19]Grigori Schwarz, Miroslaw Truszczynski: Subnormal Modal Logics for Knowledge Representation. AAAI 1993: 438-443
- [c18]Grigori Schwarz, Miroslaw Truszczynski: Nonmonotonic Reasoning is Sometimes Simpler. Kurt Gödel Colloquium 1993: 313-324
- [c17]V. Wiktor Marek, Miroslaw Truszczynski: Reflective Autoepistemic Logic and Logic Programming. LPNMR 1993: 115-131
- [c16]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. Discrete Applied Mathematics 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. Discrete Mathematics 103(3): 301-312 (1992)
- [j15]V. Wiktor Marek, Miroslaw Truszczynski: More on modal aspects of default logic. Fundam. Inform. 17(1-2): 99-116 (1992)
- [j14]Miroslaw Truszczynski: Generalized local colorings of graphs. J. Comb. Theory, Ser. 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)
- [c15]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
- [c14]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. Discrete Mathematics 87(3): 237-248 (1991)
- [j11]Miroslaw Truszczynski, Zsolt Tuza: Asymptotic results on saturated graphs. Discrete Mathematics 87(3): 309-314 (1991)
- [j10]Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza: Decompositions of regular bipartite graphs. Discrete Mathematics 89(1): 17-27 (1991)
- [j9]Miroslaw Truszczynski: Decompositions of graphs into forests with bounded maximum degree. Discrete Mathematics 98(3): 207-222 (1991)
- [j8]Miroslaw Truszczynski: Modal nonmonotonic logic with restricted application of the negation as failure to prove rule. Fundam. Inform. 14(3): 355-366 (1991)
- [j7]
- [c13]
- [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]
- [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]
- [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 and Combinatorics 3(1): 67-73 (1987)
- 1985
- [j4]Miroslaw Truszczynski: Note on the decomposition of lambdaKm, n (lambdaKm, n*) into paths. Discrete Mathematics 55(1): 89-96 (1985)
- 1981
- [j3]Miroslaw Truszczynski: Algorithmic aspects of the attribute set minimization problem. Fundam. Inform. 4(2): 419-426 (1981)
- [c3]
- [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. Inform. 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
[i32] [i30] [j47] [j46] [c73] [c70] [i24] [c63] [j39] [j38] [j37] [c61] [c60] [c58] [j34] [c51] [i20] [i19] [j32] [c49] [c47] [i18] [j30] [c45] [c44] [i15] [c38] [i10] [j28] [j27] [c34] [i4] [i2] [j25] [c33] [c32] [c31] [i1] [j24] [c30] [c27] [c26] [j20] [c25] [c24] [c21] [c20] [b1] [j18] [c17] [j15] [j13] [c15] [j7] [c11] [c10] [c8] [j6] [c6] [c5] [c4]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:16 CEST by the dblp team