Victor W Marek

Professor of Computer Science
Department of Computer Science
University of Kentucky, Lexington
E-mail: marek@cs.uky.edu
Page: http://www.cs.uky.edu/~marek/papers.dir/papersvm.html

Fields of interest:

  • Mathematical logic,
  • Combinatorics,
  • Mathematical Foundations of Artificial intelligence

Recent publications :

V.W. Marek:
Index sets for finite normal predicate logic programs with function symbols,
Springer Lecture Notes in Computer Science, 9537 (2016), pp. 60-75

V.W. Marek, I. Niemela and M. Truszczynski:
Logic Programs with Monotone Abstract Constraint Atoms,
Theory and Practice of Logic Programming, Vol.  8, (2008), pp.
167-199.

V.W. Marek and J.B. Remmel:
Compactness Properties of Stable Semantics for Logic Programs,
Fundamenta Informaticae, Vol. 81, (2007), pp. 211-239.

V.W. Marek:
Characterizing Pawlak’s Approximation Operators,
Transactions on Rough Sets, Vol. 7, (2007, pp. 140-150.

V.W. Marek, I. Pivkina and M. Truszczynski:
Approximating answer sets of unitary Lifschitz-Woo programs. Logic Programming and Nonmonotonic Reasoning,
Proceedings of the 8th International Conference, Springer Lecture Notes in Computer
Science,
2005.

R.S. Boyer, V.W. Marek and W.J. Legato:
Toward Automating the Discovery of Decreasing Measures.
Journal of Automated Reasoning, Vol. 35, (2005), pp. 355-371.

D. Cenzer, V.W. Marek and J.B. Remmel:
Using logic programs to reason about infinite sets,
Annals of Mathematics and Artificial Intelligence, Vol. 44, (2005), pp.
309-339.

R. Finkel, V.W. Marek and M. Truszczynski: 
Constraint Lingo: Towards high-level constraint programming.
Software: Practice and experience, Vol. 34(15), (2004), pp.1481-1504.

M. Denecker, V.W. Marek and M. Truszczynski:
Ultimate approximation and its applications in nonmonotonic knowledge representation
systems,
Information and Computation, Vol. 192, (2004), pp. 84-121.

M.R. Dransfield, L. Liu, V.W. Marek and M. Truszczynski: 
Satisfiability and Computing van der Waerden Numbers,
Electronic Journal of Combinatorics, Vol. 11(1), (2004), R 41.