- A Framework for Representing and Solving NP Search Problems David G. Mitchell and Eugenia Ternovska
- Complexity of Expanding a Finite Structure and Related Tasks Antonina Kolokolova, Yongmei Liu, David Mitchell, Eugenia Ternovska
- Reducing Inductive Definitions to Propositional Satisfiability
- Inductive Definability and the Situation Calculus Eugenia Ternovskaia
- Automata Theory for Reasoning about Actions Eugenia Ternovskaia
- Model Checking Abstract State Machines with Answer Set Programming
- Constructing Camin-Sokal Phylogenies via Answer Set Programming
- On the Complexity of Model Expansion Antonina Kolokolova1
- Model Expansion as a Framework for Modelling and Solving Search Problems
- Built-in Arithmetic in Knowledge Representation Shahab Tasharrofi and Eugenia Ternovska
- PBINT, a logic for modelling search problems involving Shahab Tasharrofi and Eugenia Ternovska
- Speed-up Techniques for Negation in Grounding Amir Aavani, Shahab Tasharrofi, Gulay Unel, Eugenia Ternovska, David Mitchell
- Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions
- Inductive Situation Calculus Marc Denecker
- Solving Modular Model Expansion Tasks Shahab Tasharrofi, Xiongnan (Newman) Wu, Eugenia Ternovska
- Knowledge Representation, Search Problems and Model Expansion
- A Semantic Account for Modularity in Multi-language Modelling of Search Problems
- Solving Modular Model Expansion Tasks Shahab Tasharrofi, Xiongnan (Newman) Wu, Eugenia Ternovska
