Eugenia Ternovska

Orcid: 0000-0003-0751-4031

Affiliations:
  • Simon Fraser University, Burnaby, Canada


According to our database1, Eugenia Ternovska authored at least 51 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Inputs, Outputs, and Composition in the Logic of Information Flows.
ACM Trans. Comput. Log., October, 2023

Promise Algebra: An Algebraic Model of Non-Deterministic Computations.
CoRR, 2023

2021
Towards Capturing PTIME with no Counting Construct (but with a Choice Operator).
CoRR, 2021

Algebra of Modular Systems: Containment and Equivalence.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Non-terminating processes in the situation calculus.
Ann. Math. Artif. Intell., 2020

Executable First-Order Queries in the Logic of Information Flows.
Proceedings of the 23rd International Conference on Database Theory, 2020

ElGolog: A High-Level Programming Language with Memory of the Execution History.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
An Algebra of Modular Systems: Static and Dynamic Perspectives.
Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving.
Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

2018
A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems.
Proceedings of the Second Workshop on Logics for Reasoning about Preferences, 2018

2017
A Semantic Approach to Combining Preference Formalisms.
FLAP, 2017

Propagators and Solvers for the Algebra of Modular Systems.
Proceedings of the LPAR-21, 2017

Recent Progress on the Algebra of Modular Systems.
Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, 2017

2016
Lifted Relational Algebra with Recursion and Connections to Modal Logic.
CoRR, 2016

How to Speed Up CUDA-WSat-PcL by 5x.
Proceedings of the Fourth International Symposium on Computing and Networking, 2016

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Clause-Learning for Modular Systems.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

Modular Systems with Preferences.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

An Algebra of Combined Constraint Solving.
Proceedings of the Global Conference on Artificial Intelligence, 2015

Towards a Preference Formalism for Modular Systems.
Proceedings of the 2015 AAAI Spring Symposia, 2015

2014
Three Semantics for Modular Systems.
CoRR, 2014

Generalized Multi-Context Systems.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

2013
Problem Solving with the Enfragmo System.
Theory Pract. Log. Program., 2013

New Encoding for Translating Pseudo-Boolean Constraints into SAT.
Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

2012
Enfragmo: A System for Modelling and Solving Search Problems with Logic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Modular Representation of a Business Process Planner.
Proceedings of the 1st International Workshop on Knowledge-intensive Business Processes, 2012

2011
Solving Modular Model Expansion Tasks
CoRR, 2011

Solving Modular Model Expansion: Case Studies.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

A Semantic Account for Modularity in Multi-language Modelling of Search Problems.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

Grounding Formulas with Complex Terms.
Proceedings of the Advances in Artificial Intelligence, 2011

2010
PBINT, A Logic for Modelling Search Problems Involving Arithmetic.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

On the Complexity of Model Expansion.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Speed-Up Techniques for Negation in Grounding.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
Declarative Programming of Search Problems with Built-in Arithmetic.
Proceedings of the IJCAI 2009, 2009

2008
A logic of nonmonotone inductive definitions.
ACM Trans. Comput. Log., 2008

Expressive power and abstraction in Essence.
Constraints An Int. J., 2008

2007
Model Checking Abstract State Machines with Answer Set Programming.
Fundam. Informaticae, 2007

Inductive situation calculus.
Artif. Intell., 2007

Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions.
Proceedings of the IJCAI 2007, 2007

2006
Constructing Camin-Sokal Phylogenies Via Answer Set Programming.
Proceedings of the Logic for Programming, 2006

2005
A Logic for Non-Monotone Inductive Definitions
CoRR, 2005

Reducing Inductive Definitions to Propositional Satisfiability.
Proceedings of the Logic Programming, 21st International Conference, 2005

A Framework for Representing and Solving NP Search Problems.
Proceedings of the Proceedings, 2005

2004
A Logic of Non-monotone Inductive Definitions and Its Modularity Properties.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

2002
The situation calculus: decidability and an approach based on the logic for non-monotone inductive definitions.
PhD thesis, 2002

A Model Checker for Verifying ConGolog Programs.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2000
ID-logic and the Ramification Problem for the Situation Calculus.
Proceedings of the ECAI 2000, 2000

1999
Automata Theory for Reasoning About Actions.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998
Inductive Definability and the Situation Calculus.
Proceedings of the Transactions and Change in Logic Databases, 1998

1994
Interval Situation Calculus.
Proceedings of the KI-94: Advances in Artificial Intelligence, 1994

Logical Formalization of Concurrent Actions for Multi-Agent Systems.
Proceedings of the Intelligent Agents, 1994


  Loading...