Esra Erdem

Türkçe sürüm

Esra Erdem

E-mail : esraerdemsabanciuniv.edu

Personal web page

Education :

Ph.D. (Computer Sciences), The University of Texas at Austin, 2002. M.S. (Computer Sciences), The University of Texas at Austin, 1998. B.S. (Computer Sciences), Bilkent University, 1996.

Work Experience :

Vienna University of Technology, 2003 - 2006. University of Toronto, 2002 - 2003. IBM, Austin Research Lab, 2001.

Areas of Interest :

Artificial intelligence. Knowledge representation. Automated reasoning. Cognitive Robotics.

Awards :

  • Distinguished Visiting Fellowship, The Scottish Informatics and Computer Science Alliance - SICSA  2019
  • Distinguished Visiting Professor Fellowship - Scottish Informatics and Computing Science Alliance (SICSA)  2019
  • Member of the Executive Committee of Association of Logic Programming - ALP  2018
  • Member of the Steering Committee of Principles of Knowledge Representation and Reasoning, Incorporated (KR, Inc.) - KR, Inc.  2018
  • Yeni Teknolojilerle Fark Yaratan Kadın Lider - Microsoft  2018
  • BAGEP, Young Scientist Award - Science Academy  2015

Membership :

AAAI, ISCB, IEEE, ALP, ACM
Before SU Publications:

 

JOURNAL ARTICLES

 

Esra Erdem, Vladimir Lifschitz, and Don Ringe. Temporal Phylogenetic Networks and Logic Programming. In Theory and Practice of Logic Programming (TPLP), 6(5):539–558, 2006.

Esra Erdem and Vladimir Lifschitz. Tight Logic Programs. In Theory and Practice of Logic Programming (TPLP), 3(4–5):499–518, 2003.

Esra Erdem and Pierre Flener. Completing Open Logic Programs by Constructive Induction. In International Journal of Intelligent Systems (IJIS), 14(10):995–1020, 1999.

 

REFEREED CONFERENCE AND WORKSHOP PAPERS

 

Thomas Eiter, Esra Erdem, Michael Fink, and Jan Senko. Comparing Action Descriptions based on Semantic Preferences. In Proceedings of the Tenth European Conference on Logics in Artificial Intelligence (JELIA’06), pages 124–137, 2006.

Esra Erdem and Alfredo Gabaldon. Representing Action Domains with Numeric-Valued Fluents. In Proceedings of the Tenth European Conference on Logics in Artificial Intelligence (JELIA’06), pages 151–163, 2006.

Thomas Eiter, Esra Erdem, Michael Fink, and Jan Senko. Resolving Conflicts in Action Descriptions. In Proceedings of the Eleventh Workshop on Nonmonotonic Reasoning (NMR’06), Action and Change Track, pages 353–361, 2006.

Esra Erdem and Elisabeth Tillier. Genome Rearrangement and Planning. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI’05), pages 1139–1144, 2005.

Esra Erdem and Alfredo Gabaldon. Cumulative Effects of Concurrent Actions on Numeric-Valued Fluents. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI’05), pages 627–632, 2005.

Thomas Eiter, Esra Erdem, Michael Fink, and J´an Senko. Updating Action Domain Descriptions. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI’05), pages 418–423, 2005.

Esra Erdem and Alfredo Gabaldon. Cumulative Effects of Concurrent Actions on Numeric-Valued Fluents. In Working Notes of the Sixth Workshop on Nonmonotonic Reasoning, Action, and Change (NRAC’05), pages 28–33, 2005.

Daniel R. Brooks, Esra Erdem, James W. Minett, and Don Ringe. Character-Based Cladistics and Answer Set Programming. In Proceedings of the Seventh International Symposium on Practical Aspects of Declarative Languages (PADL’05), pages 37–51, 2005.

Esra Erdem and Martin Wong. Rectilinear Steiner Tree Construction using Answer Set Programming. In Proceedings of the Twentieth International Conference on Logic Programming (ICLP’04), pages 386–399, 2004.

Thomas Eiter, Esra Erdem, andWolfgang Faber. Plan Reversals for Recovery in Execution Monitoring. In Proceedings of the Tenth Workshop on Nonmonotonic Reasoning (NMR’04), Action and Causality Track, pages 147–154, 2004.

Esra Erdem, Vladimir Lifschitz, Luay Nakhleh and Don Ringe. Reconstructing the Evolutionary History of Indo-European Languages using Answer Set Programming. In Proceedings of the Fifth International Symposium on Practical Aspects of Declarative Languages (PADL’03), pages 160–176, 2003.

Esra Erdem and Vladimir Lifschitz. Fages’ Theorem for Programs with Nested Expressions. In Proceedings of the Seventeenth International Conference on Logic Programming (ICLP’01), pages 242–254, 2001.

Esra Erdem and Vladimir Lifschitz. Transitive Closure, Answer Sets and Predicate Completion. In Proceedings of American Association for Artificial Intelligence (AAAI) Spring Symposium, pages 60–65, 2001.

Esra Erdem and Pierre Flener. A New Declarative Bias for ILP: Construction Modes. In Work-in-Progress Reports of the Tenth International Conference on Inductive Logic Programming (ILP’00), pages 60–78, 2000.

Esra Erdem, Vladimir Lifschitz, and Martin D. F. Wong. Wire Routing and Satisfiability Planning. In Proceedings of the First International Conference on Computational Logic (CL’00), pages 822–836, 2000.

Yuliya Babovich, Esra Erdem and Vladimir Lifschitz. Fages’ Theorem and Answer Set Programming. In Proceedings of the Eighth International Workshop on Non-Monotonic Reasoning (NMR’00), 2000.

Esra Erdem and Vladimir Lifschitz. Transformations of Logic Programs Related to Causality and Planning. In Proceedings of the Fifth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’99), pages 107–116, 1999.