default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugenia Ternovska
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. Log. Methods Comput. Sci. 20(2) (2024)- 2023
- [j8]Heba Aamer
, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Inputs, Outputs, and Composition in the Logic of Information Flows. ACM Trans. Comput. Log. 24(4): 33:1-33:44 (2023) - [i9]Eugenia Ternovska:
Promise Algebra: An Algebraic Model of Non-Deterministic Computations. CoRR abs/2311.12312 (2023) - 2022
- [i8]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Inputs, Outputs, and Composition in the Logic of Information Flows. CoRR abs/2209.06448 (2022) - [i7]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. CoRR abs/2210.00240 (2022) - 2021
- [c40]Andrei Bulatov, Eugenia Ternovska:
Algebra of Modular Systems: Containment and Equivalence. AAAI 2021: 6235-6243 - [i6]Eugenia Ternovska:
Towards Capturing PTIME with no Counting Construct (but with a Choice Operator). CoRR abs/2111.07978 (2021) - 2020
- [j7]Giuseppe De Giacomo, Eugenia Ternovska, Ray Reiter:
Non-terminating processes in the situation calculus. Ann. Math. Artif. Intell. 88(5-6): 623-640 (2020) - [c39]Giuseppe De Giacomo, Yves Lespérance, Eugenia Ternovska:
ElGolog: A High-Level Programming Language with Memory of the Execution History. AAAI 2020: 2806-2813 - [c38]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Executable First-Order Queries in the Logic of Information Flows. ICDT 2020: 4:1-4:14 - [c37]Heba Aamer, Bart Bogaerts, Dimitri Surinx, Eugenia Ternovska, Jan Van den Bussche:
Inputs, Outputs, and Composition in the Logic of Information Flows. KR 2020: 2-11
2010 – 2019
- 2019
- [c36]Alireza Ensan, Eugenia Ternovska:
A Language-Independent Framework for Reasoning About Preferences for Declarative Problem Solving. FroCos 2019: 57-73 - [c35]Eugenia Ternovska:
An Algebra of Modular Systems: Static and Dynamic Perspectives. FroCos 2019: 94-111 - 2018
- [c34]Alireza Ensan, Eugenia Ternovska, Heng Liu:
A Model-Theoretic View on Preferences in Declarative Specifications of Search Problems. PRUV@IJCAR 2018 - 2017
- [j6]Alireza Ensan, Eugenia Ternovska:
A Semantic Approach to Combining Preference Formalisms. FLAP 4(7) (2017) - [c33]Eugenia Ternovska:
Recent Progress on the Algebra of Modular Systems. AMW 2017 - [c32]Bart Bogaerts, Eugenia Ternovska, David G. Mitchell:
Propagators and Solvers for the Algebra of Modular Systems. LPAR 2017: 227-248 - 2016
- [c31]Tomi Janhunen, Shahab Tasharrofi, Eugenia Ternovska:
SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators. AAAI 2016: 978-984 - [c30]Heng Liu, Arrvindh Shriraman, Evgenia Ternovska:
How to Speed Up CUDA-WSat-PcL by 5x. CANDAR 2016: 462-468 - [i5]Bart Bogaerts, Eugenia Ternovska, David G. Mitchell:
Propagators and Solvers for the Algebra of Modular Systems. CoRR abs/1606.08130 (2016) - [i4]Eugenia Ternovska:
Lifted Relational Algebra with Recursion and Connections to Modal Logic. CoRR abs/1612.09251 (2016) - 2015
- [c29]Alireza Ensan, Eugenia Ternovska:
Towards a Preference Formalism for Modular Systems. AAAI Spring Symposia 2015 - [c28]Eugenia Ternovska:
An Algebra of Combined Constraint Solving. GCAI 2015: 275-295 - [c27]Alireza Ensan, Eugenia Ternovska:
Modular Systems with Preferences. IJCAI 2015: 2940-2947 - [c26]David G. Mitchell, Eugenia Ternovska:
Clause-Learning for Modular Systems. LPNMR 2015: 446-452 - 2014
- [c25]Shahab Tasharrofi, Eugenia Ternovska:
Generalized Multi-Context Systems. KR 2014 - [i3]Shahab Tasharrofi, Eugenia Ternovska:
Three Semantics for Modular Systems. CoRR abs/1405.1229 (2014) - 2013
- [j5]Amir Aavani, Eugenia Ternovska, David G. Mitchell:
Problem Solving with the Enfragmo System. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c24]Amir Aavani, David G. Mitchell, Eugenia Ternovska:
New Encoding for Translating Pseudo-Boolean Constraints into SAT. SARA 2013 - [e2]Konstantin Korovin, Stephan Schulz, Eugenia Ternovska:
IWIL 2012: The 9th International Workshop on the Implementation of Logics, Merida, Venezuela, March 10, 2012. EPiC Series in Computing 22, EasyChair 2013 [contents] - 2012
- [c23]Shahab Tasharrofi, Eugenia Ternovska:
Modular Representation of a Business Process Planner. KiBP@KR 2012: 75-88 - [c22]Amir Aavani, Xiongnan (Newman) Wu, Shahab Tasharrofi, Eugenia Ternovska, David G. Mitchell:
Enfragmo: A System for Modelling and Solving Search Problems with Logic. LPAR 2012: 15-22 - [e1]Geoff Sutcliffe, Stephan Schulz, Eugenia Ternovska:
The 8th International Workshop on the Implementation of Logics, IWIL 2010, Yogyakarta, Indonesia, October 9, 2011. EPiC Series in Computing 2, EasyChair 2012 [contents] - 2011
- [c21]Amir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David G. Mitchell:
Grounding Formulas with Complex Terms. Canadian AI 2011: 13-25 - [c20]Shahab Tasharrofi, Eugenia Ternovska:
A Semantic Account for Modularity in Multi-language Modelling of Search Problems. FroCoS 2011: 259-274 - [c19]Shahab Tasharrofi, Xiongnan (Newman) Wu, Eugenia Ternovska:
Solving Modular Model Expansion: Case Studies. INAP/WLP 2011: 215-236 - [i2]Shahab Tasharrofi, Xiongnan (Newman) Wu, Eugenia Ternovska:
Solving Modular Model Expansion Tasks. CoRR abs/1109.0583 (2011) - 2010
- [c18]Amir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell:
Speed-Up Techniques for Negation in Grounding. LPAR (Dakar) 2010: 13-26 - [c17]Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska:
On the Complexity of Model Expansion. LPAR (Yogyakarta) 2010: 447-458 - [c16]Shahab Tasharrofi, Eugenia Ternovska:
PBINT, A Logic for Modelling Search Problems Involving Arithmetic. LPAR (Yogyakarta) 2010: 610-624
2000 – 2009
- 2009
- [c15]Eugenia Ternovska, David G. Mitchell:
Declarative Programming of Search Problems with Built-in Arithmetic. IJCAI 2009: 942-947 - 2008
- [j4]David G. Mitchell, Eugenia Ternovska:
Expressive power and abstraction in Essence. Constraints An Int. J. 13(3): 343-384 (2008) - [j3]Marc Denecker, Eugenia Ternovska:
A logic of nonmonotone inductive definitions. ACM Trans. Comput. Log. 9(2): 14:1-14:52 (2008) - 2007
- [j2]Marc Denecker, Eugenia Ternovska:
Inductive situation calculus. Artif. Intell. 171(5-6): 332-360 (2007) - [j1]Calvin Kai Fan Tang, Eugenia Ternovska:
Model Checking Abstract State Machines with Answer Set Programming. Fundam. Informaticae 77(1-2): 105-141 (2007) - [c14]Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta:
Grounding for Model Expansion in k-Guarded Formulas with Inductive Definitions. IJCAI 2007: 161-166 - 2006
- [c13]Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta:
Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR 2006: 452-466 - 2005
- [c12]David G. Mitchell, Eugenia Ternovska:
A Framework for Representing and Solving NP Search Problems. AAAI 2005: 430-435 - [c11]Calvin Kai Fan Tang, Eugenia Ternovska:
Model Checking Abstract State Machines with Answer Set Programming. Abstract State Machines 2005: 397-416 - [c10]Nikolay Pelov, Eugenia Ternovska:
Reducing Inductive Definitions to Propositional Satisfiability. ICLP 2005: 221-234 - [c9]Calvin Kai Fan Tang, Eugenia Ternovska:
Model Checking Abstract State Machines with Answer Set Programming. LPAR 2005: 443-458 - [i1]Marc Denecker, Eugenia Ternovska:
A Logic for Non-Monotone Inductive Definitions. CoRR abs/cs/0501025 (2005) - 2004
- [c8]Marc Denecker, Eugenia Ternovska:
Inductive Situation Calculus. KR 2004: 545-553 - [c7]Marc Denecker, Eugenia Ternovska:
A Logic of Non-monotone Inductive Definitions and Its Modularity Properties. LPNMR 2004: 47-60 - 2002
- [b1]Eugenia Ternovska:
The situation calculus: decidability and an approach based on the logic for non-monotone inductive definitions. University of Toronto, Canada, 2002 - [c6]Leila Kalantari, Eugenia Ternovska:
A Model Checker for Verifying ConGolog Programs. AAAI/IAAI 2002: 953-954 - 2000
- [c5]Eugenia Ternovskaia:
ID-logic and the Ramification Problem for the Situation Calculus. ECAI 2000: 563-570
1990 – 1999
- 1999
- [c4]Eugenia Ternovskaia:
Automata Theory for Reasoning About Actions. IJCAI 1999: 153-159 - 1998
- [c3]Eugenia Ternovskaia:
Inductive Definability and the Situation Calculus. Transactions and Change in Logic Databases 1998: 227-248 - 1994
- [c2]Mikhail Soutchanski, Eugenia Ternovskaia:
Logical Formalization of Concurrent Actions for Multi-Agent Systems. ECAI Workshop on Agent Theories, Architectures, and Languages 1994: 129-144 - [c1]Eugenia Ternovskaia:
Interval Situation Calculus. KI 1994: 400
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-12 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
