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