E. Erdem and F. Ture. Efficient haplotype inference with answer set
programming. In Proc. of AAAI'08, pp. 436-441.
[abstract]
This
version appeared in Proc. of AAAI'08, pp. 1834-1835, as a student abstract.
T. Eiter, E. Erdem, and W. Faber. Undoing the effects of action sequences. In Journal of Applied Logic (JAL), Vol. 6(3), pp. 380-415, 2008. [abstract]
D. Brooks, E. Erdem, S. Erdogan, J. Minett, and D. Ringe. Inferring phylogenetic trees using answer set programming. In Journal of Automated Reasoning (JAR), Vol. 39(4), pp. 471-511, 2007. [abstract]
M. Cayli, A. G. Karatop, E. Kavlak, H. Kaynar, F. Ture, and E. Erdem. Solving challenging grid puzzles with answer set programming. In Proc. of ASP'07, pp. 175-190. [abstract]
T. Eiter, E. Erdem, M. Fink, and J. Senko. Comparing action descriptions based on semantic preferences. In Annals of Mathematics and Artificial Intelligence (AMAI), Vol. 50(3-4), pp. 273-304, 2007. [abstract]
E. Erdem and P. Ferraris. Forgetting actions in domain descriptions. In Proc. of AAAI'07, pp. 409-414. [abstract]
T. Eiter, E. Erdem, W. Faber, and J. Senko. A logic-based approach to finding explanations for discrepancies in optimistic plan execution. In Fundamenta Informaticae (FI), Vol. 79(1-2), pp. 25-69, 2007. [abstract]
T. Eiter, E. Erdem, and W. Faber. On reversing actions: Algorithms and complexity. In Proc. of IJCAI'07, pp. 336-341. [abstract]
E. Erdem and F. Wang. Reconstructing the evolutionary history of Chinese dialects. Accepted for presentation at the 39th International Conference on Sino-Tibetan Languages and Linguistics (ICSTLL'06).
T. Eiter, E. Erdem, M. Fink, and J. Senko. Comparing
action descriptions based on semantic preferences. In Proc. of
JELIA'06, pp. 124-137. [abstract]
This
version appeared in Proc. of ECAI'06 Multidisciplinary Workshop on
Advances in Preference Handling.
E. Erdem and A. Gabaldon. Representing action domains with numeric-valued fluents. In Proc. of JELIA'06, pp. 151-163. [abstract]
T. Eiter, E. Erdem, M. Fink, and J. Senko. Resolving
conflicts in action descriptions. In Proc. of ECAI'06, pp.
424-433. [abstract]
This
version appeared in Proc. of NMR'06, Action and Change track, pp.
353-361.
E. Erdem, V. Lifschitz, and D. Ringe. Temporal phylogenetic networks and logic programming. In Theory and Practice of Logic Programming (TPLP), Vol. 6(5), pp. 539-558, 2006. [abstract]
E. Erdem and E. Tillier. Genome rearrangement and planning. In Proc. of AAAI'05, pp. 1139-1144. [abstract]
E. Erdem and A. Gabaldon. Cumulative
effects of concurrent actions on numeric-valued fluents. In Proc. of
AAAI'05, pp. 627-632. [abstract]
This
version appeared in Working Notes of NRAC'05, pp. 28-33.
T. Eiter, E. Erdem, M. Fink, and J. Senko. Updating action domain descriptions. In Proc. of IJCAI'05, pp. 418-423. [abstract]
D. R. Brooks, E. Erdem, J. W. Minett, and D. Ringe. Character-based cladistics and answer set programming. In Proc. of PADL'05, pp. 37-51. [abstract]
T. Eiter, E. Erdem, and W. Faber. Undoing the effects of action sequences. Tech. Report INFSYS RR-1843-04-05, Vienna University of Technology, 2004.
T. Eiter, E. Erdem, and W. Faber. Diagnosing plan execution discrepancies in a logic-based action framework. Tech. Report INFSYS RR-1843-04-03, Vienna University of Technology, 2004. [abstract]
E. Erdem and M. D. F. Wong. Rectilinear steiner tree construction using answer set programming. In Proc. of ICLP'04, pp. 386-399. [abstract] [errata]
T. Eiter, E. Erdem, and W. Faber. Plan reversals for recovery in execution monitoring,. In Proc. of NMR'04, Action and Causality Track. [abstract]
E. Erdem and V. Lifschitz. Tight logic programs. Theory and Practice of Logic Programming (TPLP), Vol. 3, pp. 499-518, 2003. [abstract]
E. Erdem, V. Lifschitz, L. Nakhleh, and D. Ringe. Reconstructing the evolutionary history of Indo-European languages using answer set programming. In Proc. of PADL'03, pp. 160-176. [abstract] [extended version with proofs]
E. Erdem. Theory and applications of answer set programming. Ph.D. Thesis. Tech. Report CS-TR-02-69, Department of Computer Sciences, University of Texas at Austin, 2002. [abstract] [pdf]
E. Erdem and V. Lifschitz. Fages' theorem for programs with nested expressions. In Proc. of ICLP'01, pp. 242-254. [abstract]
E. Erdem and V. Lifschitz. Transitive closure, answer sets and predicate completion. In Working Notes of AAAI Spring Symposium, pp. 60-65, 2001. [abstract]
E. Erdem, V. Lifschitz, and M. D. F. Wong. Wire routing and satisfiability planning. In Proc. of CL'00, pp. 822-836. [abstract]
E. Erdem and P. Flener. A new declarative bias for ILP: construction modes. In Work-in-Progress Reports of ILP'00, pp. 60-78. [abstract]
Y. Babovich, E. Erdem, and V. Lifschitz. Fages' theorem and answer set programming. In Proc. of NMR'00. [abstract]
E. Erdem and V. Lifschitz. Transformations of logic programs related to causality and planning. In Proc. of LPNMR'99, pp. 107-116. [abstract]
E. Erdem. Applications of logic programs to planning: computational experiments. Unpublished draft. [abstract] [postscript]
E. Erdem and P. Flener. A new heuristic to use least generalizations in ILP. Unpublished draft. [abstract]
E. Erdem and P. Flener. Completing open logic programs by constructive induction. International Journal of Intelligent Systems (IJIS), Vol. 14(10), pp. 995-1020, 1999. [abstract]
E. Erdem and P. Flener. A re-definition of least generalizations, and construction modes as a new declarative bias for ILP. Tech. Report BU-CEIS-9718, Bilkent University, 1997. [abstract]
E. Erdem. An MSG-method for inductive logic program synthesis. Senior Project Final Report, 1996. [abstract]