Answer
Set Optimization
G. Brewka, I. Niemela, M. Truszczynski, Proceedings of IJCAI-03,
2003.
Local-search
techniques
for propositional logic with cardinality constraints
L. Liu, M. Truszczynski, Proceedings of CP-2003.
Computing
minimal models, stable models and answer sets
Z. Lonc, M. Truszczynski, Proceedings of ICLP-2003.
Z. Lonc, M. Truszczynski, Theory and Practice of Logic
Programming, 4 (2004), pp. 193-231
(Preliminary version appeared in the
Proceedings of ICLP-02 - see below)
Fixed-parameter
complexity of semantics for logic programs
Z. Lonc, M. Truszczynski, ACM
Transactions on Computational Logic,
4 (2003) pp. 91-119
(Preliminary
version appeared in the
Proceedings of ICLP-2001 - see below)
Uniform
semantic treatment of default and autoepistemic logics
M. Denecker, V. Marek, M.
Truszczynski, Artificial Intelligence Journal, 143 (2003), pp. 79-122
(Preliminary version
appeared in the Proceedings of KR2000 - see below)
2002
Ultimate approximations in nonmonotonic
knowlege representation systems
M. Denecker, V. Marek, M. Truszczynski. Principles of Knowledge
Representation
and Reasoning, Proceedings of the Eighth International Conference
(KR2002)}, D. Fensel, D. McGuinness and M.-A. Williams, eds., 2002,
Morgan Kaufmann
Publishers.
The aspps
system
D. East, M. Truszczynski, Proceedings of the 8th European
Conference on Logics in Artificial Intelligence (JELIA), Lecture Notes
in Computer Science,
Springer Verlag, 2424, pp. 533-536, 2002
Constraint
Lingo: A program for solving logic puzzles and other tabular constraint
problems
R. Finkel, V. Marek, M. Truszczynski, Proceedings of the 8th
European Conference on Logics in Artificial Intelligence (JELIA),
Lecture Notes in Computer Science, Springer Verlag, 2424, pp. 513--516.
Computing
large and small stable models
M. Truszczynski, Theory and Practice
of Logic Programming, 2(1),
1-23, 2002.
(Preliminary
version appeared in the Proceedings of ICLP-99 see below)
Computing
stable models: worst-case performance estimates
Z. Lonc, M. Truszczynski, Proceedings
of ICLP-02.
Annotated
revision programs
V.W. Marek, I. Pivkina, M.
Truszczynski, Artificial Intelligence
Journal, 138(2002), pp. 149-180.
(
Preliminary version appeared in Proceedings of LPNMR-99 - see below)
Ultimate
approximations in nonmonotonic knowledge representation systems
M. Denecker, V.W. Marek, M.
Truszczynski, Principles of Knowledge
Representation and Reasoning, Proceedings of the Eighth International
Conference (KR2002)}, D. Fensel, D. McGuinness and M.-A. Williams,
eds., 2002, Morgan Kaufmann
Publishers.
2001
Propositional
satisfiability in answer-set programming
D. East, M. Truszczynski, Proceedings
of KI-2001, LNAI 2174,
Springer Verlag, 2001.
aspps
- an implementation of answer-set ptogramming with
propositional schemata
D. East, M. Truszczynski, Proceedings
of LPNMR-2001, LNAI 2173,
Springer Verlag, 2001.
Fixed-parameter
complexity of semantics for logic programs
Z. Lonc, M. Truszczynski, Proceedings of ICLP-2001.
On
the problem of computing the well-founded semantics
Z. Lonc, M. Truszczynski, Theory and
Practice of Logic
Programming, 1(5), 591-609, 2001.
(Preliminary version appeared
in the Proceedings of CL 2000,
Springer Verlag, July 2000 - see below)
2000
Approximations,
stable operators, well-founded fixpoints and
applications in nonmonotonic reasoning
M. Denecker, V. Marek, M.
Truszczynski, Logic-Based Artificial
Intelligence, J. Minker, ed., Kluwer Academic Publishers, 2000.
Uniform semantic treatment
of default and autoepistemic logics
M. Denecker, V. Marek, M. Truszczynski., Proceedings of KR2000.
DATALOG
with constraints - an answer-set programming system
D. East, M. Truszczynski, Proceedings
of AAAI-00, 2000.
On the
problem of computing the well-founded semantics
Z. Lonc, M. Truszczynski, Proceedings
of CL 2000.
1999
Stable
logic programming - an alternative logic programming paradigm
V. W. Marek, M. Truszczynski, in: The
Logic Programming Paradigm:
A 25-Year Perspective, editors: K.R. Apt, V.W. Marek, M. Truszczynski,
D.S. Warren, Springer-Verlag, 1999.
Fixpoint
3-valued semantics for autoepistemic logic
M. Denecker, V.W. Marek, M.
Truszczynski, in: Logical Foundations
for Cognitive Agents: Contributions in Honor of Ray Reiter, editors:
H.J.
Levesque, F. Pirri, Springer-Verlag, pp. 113-136, 1999.
Contributions
to the theory of rough sets
V.W. Marek, M. Truszczynski,
Fundamenta Informaticae, 39(1999),
pp. 389-489.
On the
accuracy and running time of GSAT
D. East, M. Truszczynski, Proceedings
of EPIA-99, Springer-Verlag,
1999.
Extremal
problems in logic programming and stable model computation
P. Cholewinski, M.
Truszczynski, Journal of Logic
Programming, 38 (1999), pp. 219--242.
Computing
large and small stable models
M. Truszczynski, Proceedings of
ICLP-99, MIT Press, 1999.
Annotated
revision programms
V. Marek, I. Pivkina, M.
Truszczynski, Proceedings of LPNMR-99,
Springer-Verlag, 1999.
Computing
with default logic
P. Cholewinski, V.W. Marek, A.
Mikitiuk, M. Truszczynski,
Artificial Intelligence Journal, 112(1999), pp. 105-146.
Revision
programming = logic programming + constraints
V.W. Marek, I. Pivkina, M.
Truszczynski, Proceedings of the
Computer Science Logic Conference (CSL 98), Springer-Verlag,1999.
1998
Fixpoint
3-valued semantics for autoepistemic logic
M. Denecker, V.W. Marek, M.
Truszczynski, Proceedings of AAAI-98,
pp. 840-845, MIT Press 1998.
Revision
programming
V.W. Marek, M. Truszczynski,,
Theoretical Computer Science,
190(1998), pp. 241-277.
1997
Representation
Theory for Default Logic
V.W. Marek, Jan Treur, M.
Truszczynski, Annals of Mathematics and
Artificial Intelligence, 21 (1997), pp. 343-358.
1996
Nonmonotonic
reasoning
is sometimes simpler
M. Truszczynski, Grigori Schwarz
Journal of Logic and Computation,
6(1996), 295 -- 308.
Approximating
the stable model semantics is hard
G. Gottlob, M. Truszczynski,
Fundamenta Informaticae, 28(1996),
123 -- 128.
Default
reasoning
system DeReS
P. Cholewinski, V.W. Marek, M.
Truszczynski, Proceedings of KR-96,
Morgan Kaufmann, 1996.
Infinitary
Default Logic for Specification of Nonmonotonic Reasoning
J. Engelfriet, V. Marek, J. Treur, M.
Truszczynski, Proceedings of
JELIA-96, Springer Lecture Notes in Computer Science 1126, pp. 224-236,
1996.
1995
Revision
programming, database updates and integrity constraints
V.W. Marek, M. Truszczynski,
Proceedings of the 5th International
Conference on Database Theory --- ICDT 95, Springer-Verlag, 1995.
Constrained
and rational default logics
A. Mikitiuk, M. Truszczynski,
Proceedings of IJCAI-95. Morgan
Kaufmann, 1995.
Experimenting
with Nonmonotonic Reasoning
P. Cholewinski, V.W. Marek, A.
Mikitiuk, M. Truszczynski,
Proceedings of the 12th International Conference on Logic Programming,
MIT Press, 1995.
Skeptical
rational extensions
A. Mikitiuk, M. Truszczynski,
Proceedings of LPNMR-95,
Springer-Verlag, 1995.
Algorithms
for Maintaining Authorization Base
W. Brooks, V.W. Marek, M.
Truszczynski, Proceedings of the 2nd
International Conference on Object-Orieented Information Systems,
Springer-Verlag, 1995.
Unpublished
Logic
programming with costs
V.W. Marek, M. Truszczynski,
unpublished note.
Minimal
number of permutations sufficient to compute all extensions
P. Cholewinski, M. Truszczynski, unpublished note.