The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Miroslaw Truszczynski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. V. Wiktor Marek, Miroslaw Truszczynski
    Autoepistemic Logic. [Citation Graph (10, 0)][DBLP]
    J. ACM, 1991, v:38, n:3, pp:588-619 [Journal]
  2. V. Wiktor Marek, Miroslaw Truszczynski
    Revision Programming, Database Updates and Integrity Constraints. [Citation Graph (2, 13)][DBLP]
    ICDT, 1995, pp:368-382 [Conf]
  3. V. Wiktor Marek, Miroslaw Truszczynski
    Revision Specifications by Means of Programs. [Citation Graph (1, 0)][DBLP]
    JELIA, 1994, pp:122-136 [Conf]
  4. V. Wiktor Marek, Miroslaw Truszczynski
    Computing Intersection of Autoepistemic Expansions. [Citation Graph (1, 0)][DBLP]
    LPNMR, 1991, pp:37-50 [Conf]
  5. V. Wiktor Marek, Miroslaw Truszczynski
    Stable Semantics for Logic Programs and Default Theories. [Citation Graph (1, 0)][DBLP]
    NACLP, 1989, pp:243-256 [Conf]
  6. Christine R. Leverenz, Miroslaw Truszczynski
    The rectilinear Steiner tree problem: algorithms and examples using permutations of the terminal set. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 1999, pp:- [Conf]
  7. Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
    Prioritized Component Systems. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:596-601 [Conf]
  8. Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
    Fixpoint 3-Valued Semantics for Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1998, pp:840-845 [Conf]
  9. Deborah East, Miroslaw Truszczynski
    DATALOG with Constraints - An Answer-Set Programming System. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:163-168 [Conf]
  10. Lengning Liu, Miroslaw Truszczynski
    Properties of Programs with Monotone and Convex Constraints. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:701-706 [Conf]
  11. Lengning Liu, Miroslaw Truszczynski
    Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  12. Victor W. Marek, Miroslaw Truszczynski
    Logic Programs with Abstract Constraint Atoms. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:86-91 [Conf]
  13. Grigori Schwarz, Miroslaw Truszczynski
    Subnormal Modal Logics for Knowledge Representation. [Citation Graph (0, 0)][DBLP]
    AAAI, 1993, pp:438-443 [Conf]
  14. Deborah East, Miroslaw Truszczynski
    More on Wire Routing with ASP. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  15. Raphael A. Finkel, Victor W. Marek, Neil Moore, Miroslaw Truszczynski
    Computing stable models in parallel. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  16. Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski
    Tabular Constraint-Satisfaction Problems and Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2001, pp:- [Conf]
  17. Zbigniew Lonc, Miroslaw Truszczynski
    On the Problem of Computing the Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:673-687 [Conf]
  18. Lengning Liu, Miroslaw Truszczynski
    Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:495-509 [Conf]
  19. V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski
    Revision Programming = Logic Programming + Integrity Constraints. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:73-89 [Conf]
  20. Miroslaw Truszczynski
    Nonmonotonic Logics and Their Algebraic Foundations. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:58-71 [Conf]
  21. Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski
    05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005, pp:- [Conf]
  22. Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, Joost Vennekens
    05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic Reasoning, Answer Set Programming and Constraints, 2005, pp:- [Conf]
  23. Deborah East, Miroslaw Truszczynski
    On the Accuracy and Running Time of GSAT. [Citation Graph (0, 0)][DBLP]
    EPIA, 1999, pp:49-61 [Conf]
  24. Cezary Iwanski, Miroslaw Truszczynski
    Optimal F-Graphs for Balanced Families of Sets. [Citation Graph (0, 0)][DBLP]
    FODO, 1981, pp:223-246 [Conf]
  25. Zbigniew Lonc, Tomasz Traczyk, Miroslaw Truszczynski
    Optimal F-Graphs for the Family of all K-Subsets of an N-Set. [Citation Graph (0, 0)][DBLP]
    FODO, 1981, pp:247-270 [Conf]
  26. Miroslaw Truszczynski
    On Admissible Families of Sets. [Citation Graph (0, 0)][DBLP]
    FODO, 1981, pp:201-221 [Conf]
  27. Hemantha Ponnuru, Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski
    Automatic Generation of English-language Steps in Puzzle Solving. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2004, pp:437-442 [Conf]
  28. Miroslaw Truszczynski, V. Wiktor Marek, Raphael A. Finkel
    Generating Cellular Puzzles with Logic Programs. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2006, pp:403-407 [Conf]
  29. Pawel Cholewinski, V. Wiktor Marek, Artur Mikitiuk, Miroslaw Truszczynski
    Experimenting with Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:267-281 [Conf]
  30. Pawel Cholewinski, Miroslaw Truszczynski
    Extremal Problems in Logic Programming and Stable Model Computation. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1996, pp:408-422 [Conf]
  31. Zbigniew Lonc, Miroslaw Truszczynski
    Fixed-Parameter Complexity of Semantics for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:197-211 [Conf]
  32. Zbigniew Lonc, Miroslaw Truszczynski
    Computing Stable Models: Worst-Case Performance Estimates. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:347-362 [Conf]
  33. Zbigniew Lonc, Miroslaw Truszczynski
    Computing Minimal Models, Stable Models, and Answer Sets. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:209-223 [Conf]
  34. V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski
    Complexity of Computing with Extended Propositional Logic Programs. [Citation Graph (0, 0)][DBLP]
    Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992, pp:93-102 [Conf]
  35. Miroslaw Truszczynski
    Computing Large and Small Stable Models. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:169-183 [Conf]
  36. Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski
    Answer Set Optimization. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:867-872 [Conf]
  37. Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson
    The computational complexity of dominance and consistency in CP-nets. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:144-149 [Conf]
  38. Artur Mikitiuk, Miroslaw Truszczynski
    Constrained and Rational Default Logics. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1509-1517 [Conf]
  39. Miroslaw Truszczynski
    Modal Interpretations of Default Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:393-398 [Conf]
  40. Joseph D. Oldham, V. Wiktor Marek, Miroslaw Truszczynski
    Intelligent Computation of Presentation Documents. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1997, pp:560-569 [Conf]
  41. Raphael A. Finkel, V. Wiktor Marek, Miroslaw Truszczynski
    Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:513-516 [Conf]
  42. Deborah East, Miroslaw Truszczynski
    The aspps System. [Citation Graph (0, 0)][DBLP]
    JELIA, 2002, pp:533-536 [Conf]
  43. Joeri Engelfriet, V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski
    Infinitary Default Logic for Specification of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    JELIA, 1996, pp:224-236 [Conf]
  44. Grigori Schwarz, Miroslaw Truszczynski
    Nonmonotonic Reasoning is Sometimes Simpler. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:313-324 [Conf]
  45. Deborah East, Miroslaw Truszczynski
    Propositional Satisfiability in Answer-Set Programming. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:138-153 [Conf]
  46. Pawel Cholewinski, V. Wiktor Marek, Miroslaw Truszczynski
    Default Reasoning System DeReS. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:518-528 [Conf]
  47. Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
    Uniform semantic treatment of default and autoepistemic logic. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:74-84 [Conf]
  48. Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
    Ultimate Approximations in Nonmonotonic Knowledge Representation Systems. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:177-190 [Conf]
  49. Michael Gelfond, Halina Przymusinska, Vladimir Lifschitz, Miroslaw Truszczynski
    Disjective Defaults. [Citation Graph (0, 0)][DBLP]
    KR, 1991, pp:230-237 [Conf]
  50. V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Truszczynski
    Modal Nonmonotonic Logics: Ranges, Characterization, Computation. [Citation Graph (0, 0)][DBLP]
    KR, 1991, pp:395-404 [Conf]
  51. V. Wiktor Marek, Miroslaw Truszczynski
    Relating Autoepistemic and Default Logics. [Citation Graph (0, 0)][DBLP]
    KR, 1989, pp:276-288 [Conf]
  52. Miroslaw Truszczynski
    Strong and Uniform Equivalence of Nonmonotonic Theories - An Algebraic Approach. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:389-399 [Conf]
  53. Deborah East, Miroslaw Truszczynski
    aspps - An Implementation of Answer-Set Programming with Propositional Schemata. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2001, pp:402-405 [Conf]
  54. Paul Borchert, Christian Anger, Torsten Schaub, Miroslaw Truszczynski
    Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:3-7 [Conf]
  55. Lengning Liu, Miroslaw Truszczynski
    WSAT(CC) - A Fast Local-Search ASP Solver. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:351-355 [Conf]
  56. Lengning Liu, Miroslaw Truszczynski
    Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:410-415 [Conf]
  57. V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski
    Logic Programs With Monotone Cardinality Atoms. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:154-166 [Conf]
  58. Victor W. Marek, Inna Pivkina, Miroslaw Truszczynski
    Approximating Answer Sets of Unitary Lifschitz-Woo Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:66-78 [Conf]
  59. V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski
    Annotated Revision Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:49-62 [Conf]
  60. V. Wiktor Marek, Miroslaw Truszczynski
    Reflective Autoepistemic Logic and Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1993, pp:115-131 [Conf]
  61. Artur Mikitiuk, Miroslaw Truszczynski
    Rational Default Logic and Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1993, pp:283-299 [Conf]
  62. Miroslaw Truszczynski
    Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1990, pp:150-169 [Conf]
  63. Artur Mikitiuk, Miroslaw Truszczynski
    Skeptical Rational Extensions. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1995, pp:259-272 [Conf]
  64. Miroslaw Truszczynski
    Embedding Default Logic into Modal Nonmonotonic Logics. [Citation Graph (0, 0)][DBLP]
    LPNMR, 1991, pp:151-165 [Conf]
  65. Miroslaw Truszczynski
    Automated Reasoning with Non-Monotonic Logics (Abstract). [Citation Graph (0, 0)][DBLP]
    LPNMR, 1997, pp:112-114 [Conf]
  66. Martin Gebser, Lengning Liu, Gayathri Namasivayam, André Neumann, Torsten Schaub, Miroslaw Truszczynski
    The First Answer Set Programming System Competition. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:3-17 [Conf]
  67. Gayathri Namasivayam, Miroslaw Truszczynski
    An Smodels System with Limited Lookahead Computation. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:278-283 [Conf]
  68. V. Wiktor Marek, Grigori Schwarz, Miroslaw Truszczynski
    Ranges of Strong Modal Nonmonotonic Logics. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic and Inductive Logic, 1990, pp:85-99 [Conf]
  69. V. Wiktor Marek, Miroslaw Truszczynski
    Normal Form Results for Default Logic. [Citation Graph (0, 0)][DBLP]
    Nonmonotonic and Inductive Logic, 1991, pp:270-283 [Conf]
  70. Nikolay Pelov, Miroslaw Truszczynski
    Semantics of disjunctive programs with monotone aggregates - an operator-based approach. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:327-334 [Conf]
  71. William Brooks, V. Wiktor Marek, Miroslaw Truszczynski
    Algorithms for Maintaining Authorization Bases. [Citation Graph (0, 0)][DBLP]
    OOIS, 1995, pp:99-110 [Conf]
  72. V. Wiktor Marek, Miroslaw Truszczynski
    Rough Sets - What Are They About? [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 1998, pp:24- [Conf]
  73. Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski
    Satisfiability and Computing van der Waerden Numbers. [Citation Graph (0, 0)][DBLP]
    SAT, 2003, pp:1-13 [Conf]
  74. Lengning Liu, Miroslaw Truszczynski
    Local Search with Bootstrapping. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  75. Grigori Schwarz, Miroslaw Truszczynski
    Modal Logic S4F and The Minimal Knowledge Paradigm. [Citation Graph (0, 0)][DBLP]
    TARK, 1992, pp:184-198 [Conf]
  76. Pawel Cholewinski, V. Wiktor Marek, Miroslaw Truszczynski, Artur Mikitiuk
    Computing with Default Logic. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:112, n:1-2, pp:105-146 [Journal]
  77. Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
    Uniform semantic treatment of default and autoepistemic logics. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2003, v:143, n:1, pp:79-122 [Journal]
  78. V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski
    Annotated revision programs. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:138, n:1-2, pp:149-180 [Journal]
  79. Grigori Schwarz, Miroslaw Truszczynski
    Minimal Knowledge Problem: A New Approach. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:67, n:1, pp:113-141 [Journal]
  80. Deborah East, Mikhail Iakhiaev, Artur Mikitiuk, Miroslaw Truszczynski
    Tools for modeling and solving search problems. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2006, v:19, n:4, pp:301-312 [Journal]
  81. V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszczynski
    Complexity of Computing with Extended Propositional Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:3-4, pp:357-378 [Journal]
  82. V. Wiktor Marek, Miroslaw Truszczynski
    Modal Logic for Default Reasoning. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  83. V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski
    Representation Theory for Default Logic. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:21, n:2-4, pp:343-358 [Journal]
  84. Michael R. Dransfield, Lengning Liu, Victor W. Marek, Miroslaw Truszczynski
    Satisfiability and Computing van der Waerden Numbers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  85. Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
    Uniform semantic treatment of default and autoepistemic logics [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  86. Deborah East, Miroslaw Truszczynski
    On the accuracy and running time of GSAT [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  87. Deborah East, Miroslaw Truszczynski
    dcs: An Implementation of DATALOG with Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  88. Chitta Baral, Miroslaw Truszczynski
    Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, NMR'2000 [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  89. Deborah East, Miroslaw Truszczynski
    DATALOG with constraints - an answer-set programming system [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  90. V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski
    Annotated revision programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  91. Deborah East, Miroslaw Truszczynski
    Propositional satisfiability in answer-set programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  92. Deborah East, Miroslaw Truszczynski
    aspps - an implementation of answer-set programming with propositional schemata [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  93. Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
    Ultimate approximations in nonmonotonic knowledge representation systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  94. Lengning Liu, Miroslaw Truszczynski
    Local-search techniques for propositional logic extended with cardinality constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  95. Lengning Liu, Miroslaw Truszczynski
    WSAT(cc) - a fast local-search ASP solver [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  96. Miroslaw Truszczynski
    Computing large and small stable models [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  97. Zbigniew Lonc, Miroslaw Truszczynski
    On the problem of computing the well-founded semantics [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  98. Zbigniew Lonc, Miroslaw Truszczynski
    Fixed-parameter complexity of semantics for logic programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  99. Zbigniew Lonc, Miroslaw Truszczynski
    Computing stable models: worst-case performance estimates [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  100. Deborah East, Miroslaw Truszczynski
    Propositional satisfiability in declarative programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  101. V. Wiktor Marek, Ilkka Niemelä, Miroslaw Truszczynski
    Logic programs with monotone cardinality atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  102. Michael R. Dransfield, V. Wiktor Marek, Miroslaw Truszczynski
    Satisfiability and computing van der Waerden numbers [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  103. Victor W. Marek, Miroslaw Truszczynski
    Stable models and an alternative logic programming paradigm [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  104. Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski
    Fixpoint 3-valued semantics for autoepistemic logic [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  105. Pawel Cholewinski, Miroslaw Truszczynski
    Extremal problems in logic programming and stable model computation [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  106. V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski
    Representation Theory for Default Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  107. Georg Gottlob, Miroslaw Truszczynski
    Approximating the Stable Model Semantics is Hard. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:1-2, pp:123-128 [Journal]
  108. V. Wiktor Marek, Miroslaw Truszczynski
    More on modal aspects of default logic. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:17, n:1-2, pp:99-116 [Journal]
  109. V. Wiktor Marek, Miroslaw Truszczynski
    Contributions to the Theory of Rough Sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:39, n:4, pp:389-409 [Journal]
  110. Miroslaw Truszczynski
    An algorithm of finding an acyclic f-graph for a family od sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:3, pp:379-396 [Journal]
  111. Miroslaw Truszczynski
    Algorithmic aspects of the attribute set minimization problem. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:2, pp:419-426 [Journal]
  112. Miroslaw Truszczynski
    Modal nonmonotonic logic with restricted application of the negation as failure to prove rule. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1991, v:14, n:3, pp:355-366 [Journal]
  113. Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
    Ultimate approximation and its application in nonmonotonic knowledge representation systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:192, n:1, pp:84-121 [Journal]
  114. Miroslaw Truszczynski
    Once More on Storage for Consecutive Retrieval. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:1, pp:21-24 [Journal]
  115. V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Truszczynski
    Modal Nonmonotonic Logics: Ranges, Characterization, Computation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1993, v:40, n:4, pp:963-990 [Journal]
  116. Miroslaw Truszczynski
    Generalized local colorings of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:178-188 [Journal]
  117. Joeri Engelfriet, V. Wiktor Marek, Jan Treur, Miroslaw Truszczynski
    Default logic and specification of nonmonotonic reasoning. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 2001, v:13, n:2, pp:99-112 [Journal]
  118. Pawel Cholewinski, Miroslaw Truszczynski
    Extremal Problems in Logic Programming and Stable Model Computation. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:38, n:2, pp:219-242 [Journal]
  119. Melvin Fitting, V. Wiktor Marek, Miroslaw Truszczynski
    The Pure Logic of Necessitation. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:3, pp:349-373 [Journal]
  120. Grigori Schwarz, Miroslaw Truszczynski
    Nonmonotonic Reasoning is Sometimes Simpler! [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1996, v:6, n:2, pp:295-308 [Journal]
  121. Raphael A. Finkel, Victor W. Marek, Miroslaw Truszczynski
    Constraint Lingo: towards high-level constraint programming. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2004, v:34, n:15, pp:1481-1504 [Journal]
  122. V. Wiktor Marek, Miroslaw Truszczynski
    Revision Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:190, n:2, pp:241-277 [Journal]
  123. Zbigniew Lonc, Miroslaw Truszczynski
    Fixed-parameter complexity of semantics for logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:1, pp:91-119 [Journal]
  124. Deborah East, Miroslaw Truszczynski
    Predicate-calculus-based logics for modeling and solving search problems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2006, v:7, n:1, pp:38-83 [Journal]
  125. Zbigniew Lonc, Miroslaw Truszczynski
    On the problem of computing the well-founded semantics. [Citation Graph (0, 0)][DBLP]
    TPLP, 2001, v:1, n:5, pp:591-609 [Journal]
  126. Zbigniew Lonc, Miroslaw Truszczynski
    Computing stable models: worst-case performance estimates. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:1-2, pp:193-231 [Journal]
  127. Miroslaw Truszczynski
    Computing large and small stable models. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:1, pp:1-23 [Journal]
  128. Miroslaw Truszczynski
    Book review: Knowledge Representation, Reasoning and Declarative Problem Solving by Chitta Baral, Cambridge University press, 2003, ISBN 0-521-81802-8. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:1-2, pp:237-239 [Journal]
  129. Zbigniew Lonc, Miroslaw Truszczynski
    Computing minimal models, stable models and answer sets. [Citation Graph (0, 0)][DBLP]
    TPLP, 2006, v:6, n:4, pp:395-449 [Journal]
  130. Miroslaw Truszczynski
    The Modal Logic S4F, the Default Logic, and the Logic Here-and-There. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:508-0 [Conf]
  131. Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski
    Logic Programs with Abstract Constraint Atoms: The Role of Computations. [Citation Graph (0, 0)][DBLP]
    ICLP, 2007, pp:286-301 [Conf]
  132. Miroslaw Truszczynski
    Logic Programming for Knowledge Representation. [Citation Graph (0, 0)][DBLP]
    ICLP, 2007, pp:76-88 [Conf]
  133. Victor W. Marek, Miroslaw Truszczynski
    Rough Sets and Approximation Schemes. [Citation Graph (0, 0)][DBLP]
    RSEISP, 2007, pp:22-28 [Conf]
  134. Miroslaw Truszczynski
    Strong and uniform equivalence of nonmonotonic theories - an algebraic approach. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:48, n:3-4, pp:245-265 [Journal]
  135. Lengning Liu, Miroslaw Truszczynski
    Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques. [Citation Graph (0, 0)][DBLP]
    Constraints, 2007, v:12, n:3, pp:345-369 [Journal]
  136. Victor W. Marek, Ilkka Niemelä, Miroslaw Truszczynski
    Logic programs with monotone abstract constraint atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  137. Miroslaw Truszczynski
    Note on the decomposition of lambdaKm, n (lambdaKm, n*) into paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:1, pp:89-96 [Journal]
  138. Andrzej Rucinski, Miroslaw Truszczynski
    A note on local colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:251-255 [Journal]
  139. Phyllis Z. Chinn, R. Bruce Richter, Miroslaw Truszczynski
    Primal graphs with small degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:3, pp:237-248 [Journal]
  140. Miroslaw Truszczynski, Zsolt Tuza
    Asymptotic results on saturated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:3, pp:309-314 [Journal]
  141. Michael S. Jacobson, Miroslaw Truszczynski, Zsolt Tuza
    Decompositions of regular bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:1, pp:17-27 [Journal]
  142. Miroslaw Truszczynski
    Decompositions of graphs into forests with bounded maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:207-222 [Journal]
  143. Miroslaw Truszczynski, Zsolt Tuza
    Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:301-312 [Journal]
  144. Lengning Liu, Miroslaw Truszczynski
    Properties and Applications of Programs with Monotone and Convex Constraints. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2006, v:27, n:, pp:299-334 [Journal]

  145. Hyperequivalence of Logic Programs with Respect to Supported Models. [Citation Graph (, )][DBLP]


  146. Representing Preferences Among Sets. [Citation Graph (, )][DBLP]


  147. Towards Debugging of Answer-Set Programs in the Language PSpb. [Citation Graph (, )][DBLP]


  148. Relativized Hyperequivalence of Logic Programs for Modular Programming. [Citation Graph (, )][DBLP]


  149. Declarative Semantics for Active Integrity Constraints. [Citation Graph (, )][DBLP]


  150. Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs. [Citation Graph (, )][DBLP]


  151. Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints. [Citation Graph (, )][DBLP]


  152. Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs. [Citation Graph (, )][DBLP]


  153. The Second Answer Set Programming Competition. [Citation Graph (, )][DBLP]


  154. Simple Random Logic Programs. [Citation Graph (, )][DBLP]


  155. Simple but Hard Mixed Horn Formulas. [Citation Graph (, )][DBLP]


  156. Logic programs with abstract constraint atoms: The role of computations. [Citation Graph (, )][DBLP]


  157. Hyperequivalence of logic programs with respect to supported models. [Citation Graph (, )][DBLP]


  158. My six encounters with Victor Marek - a personal account. [Citation Graph (, )][DBLP]


  159. Preface. [Citation Graph (, )][DBLP]


  160. Computing minimal models, stable models and answer sets [Citation Graph (, )][DBLP]


  161. Relativized hyperequivalence of logic programs for modular programming [Citation Graph (, )][DBLP]


  162. Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs [Citation Graph (, )][DBLP]


  163. Indexing functions and time lower bounds for sorting on a mesh-connected computer. [Citation Graph (, )][DBLP]


  164. On the number of minimal transversals in 3-uniform hypergraphs. [Citation Graph (, )][DBLP]


Search in 0.420secs, Finished in 0.428secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002