Margarita V. Korovina

According to our database, Margarita V. Korovina authored at least 43 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

The ksmt calculus is a <i>δ</i>-complete decision procedure for non-linear constraints.

Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller

Theor. Comput. Sci., October, 2023

2021

The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints.

Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller

Proceedings of the Automated Deduction - CADE 28, 2021

2020

On the computability of ordered fields.

Margarita V. Korovina, Oleg V. Kudinov

CoRR, 2020

2019

A CDCL-Style Calculus for Solving Non-linear Constraints.

Franz Brauße, Konstantin Korovin, Margarita V. Korovina, Norbert Th. Müller

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

Computable Topology for Reliable Computations.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Perspectives of System Informatics, 2019

2018

Complexity for partial computable functions over computable Polish spaces.

Margarita V. Korovina, Oleg V. Kudinov

Math. Struct. Comput. Sci., 2018

Weak Reduction Principle and Computable Metric Spaces.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Computable elements and functions in effectively enumerable topological spaces.

Margarita V. Korovina, Oleg V. Kudinov

Math. Struct. Comput. Sci., 2017

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.

Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen

Math. Struct. Comput. Sci., 2017

The Rice-Shapiro theorem in Computable Topology.

Margarita V. Korovina, Oleg V. Kudinov

Log. Methods Comput. Sci., 2017

Highlights of the Rice-Shapiro Theorem in Computable Topology.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Perspectives of System Informatics, 2017

On Higher Effective Descriptive Set Theory.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Unveiling Dynamics and Complexity, 2017

Outline of Partial Computability in Computable Topology.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Unveiling Dynamics and Complexity, 2017

2015

Positive predicate structures for continuous data.

Margarita V. Korovina, Oleg V. Kudinov

Math. Struct. Comput. Sci., 2015

Using Taylor Models in Exact Real Arithmetic.

Franz Brauße, Margarita Vladimirovna Korovina, Norbert Th. Müller

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Towards Using Exact Real Arithmetic for Initial Value Problems.

Franz Brauße, Margarita V. Korovina, Norbert Th. Müller

Proceedings of the Perspectives of System Informatics, 2015

Rice's Theorem in Effectively Enumerable Topological Spaces.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Index Sets as a Measure of Continuous Constraint Complexity.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Perspectives of System Informatics, 2014

2011

Reachability in One-Dimensional Controlled Polynomial Dynamical Systems.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

Proceedings of the Perspectives of Systems Informatics, 2011

2010

Computing combinatorial types of trajectories in Pfaffian Dynamics.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

J. Log. Algebraic Methods Program., 2010

Making big steps in trajectories

Norbert Th. Müller, Margarita V. Korovina

Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

2009

The Uniformity Principle for Sigma-definability.

Margarita V. Korovina, Oleg V. Kudinov

J. Log. Comput., 2009

Sigma_<i>K</i>-constraints for Hybrid Systems.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Perspectives of Systems Informatics, 2009

2008

Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

Theory Comput. Syst., 2008

On sigma-definability without equality over the real numbers.

Andrei S. Morozov, Margarita V. Korovina

Math. Log. Q., 2008

Towards Computability over Effectively Enumerable Topological Spaces.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Remarks on Sigma-definability without the equality test over the Reals.

Andrei S. Morozov, Margarita V. Korovina

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

The Uniformity Principle for <i>Sigma</i> -Definability with Applications to Computable Analysis.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Computation and Logic in the Real World, 2007

2006

Satisfiability of Viability Constraints for Pfaffian Dynamics.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

Proceedings of the Perspectives of Systems Informatics, 2006

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 08.01., 2006

Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Towards Computability of Higher Type Continuous Data.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the New Computational Paradigms, 2005

2004

Pfaffian Hybrid Systems.

Margarita V. Korovina, Nicolai N. Vorobjov Jr.

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003

Gandy's Theorem for Abstract Structures without the Equality Test.

Margarita V. Korovina

Proceedings of the Logic for Programming, 2003

Recent Advances in S-Definability over Continuous Data Types.

Margarita V. Korovina

Proceedings of the Perspectives of Systems Informatics, 2003

Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test.

Margarita V. Korovina

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Fixed Points on the Real Numbers without the Equality Test.

Margarita V. Korovina

Proceedings of the Computability and Complexity in Analysis, 2002

Fixed points on abstract structures without the equality test.

Margarita V. Korovina

Proceedings of the Fixed Points in Computer Science, 2002

2001

Generalised Computability and Applications to Hybrid Systems.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Perspectives of System Informatics, 2001

Semantic Characterisations of Second-Order Computability over the Real Numbers.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999

A Logical Approach to Specification of Hybrid Systems.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Perspectives of System Informatics, 1999

1998

Characteristic Properties of Majorant-Computability over the Reals.

Margarita V. Korovina, Oleg V. Kudinov

Proceedings of the Computer Science Logic, 12th International Workshop, 1998