default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnatoli Degtyarev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c26]Sandra Alves
, Anatoli Degtyarev, Maribel Fernández:
Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics. LOPSTR 2014: 148-163
2000 – 2009
- 2006
- [j9]Anatoli Degtyarev, Michael Fisher, Boris Konev:
Monodic temporal resolution. ACM Trans. Comput. Log. 7(1): 108-150 (2006) - [c25]Vladimir Aleksic, Anatoli Degtyarev:
On Arbitrary Selection Strategies for Basic Superposition. JELIA 2006: 20-28 - 2005
- [j8]Boris Konev, Anatoli Degtyarev, Clare Dixon, Michael Fisher, Ullrich Hustadt:
Mechanising first-order temporal resolution. Inf. Comput. 199(1-2): 55-86 (2005) - [c24]Vladimir Aleksic, Anatoli Degtyarev:
Regular Derivations in Basic Superposition-Based Calculi. LPAR 2005: 292-306 - 2003
- [j7]Anatoli Degtyarev, Robert Nieuwenhuis, Andrei Voronkov:
Stratified resolution. J. Symb. Comput. 36(1-2): 79-99 (2003) - [c23]Anatoli Degtyarev, Michael Fisher, Boris Konev:
Monodic Temporal Resolution. CADE 2003: 397-411 - [c22]Boris Konev, Anatoli Degtyarev, Michael Fisher:
Handling Equality in Monodic Temporal Resolution. LPAR 2003: 214-228 - [c21]Boris Konev, Anatoli Degtyarev, Clare Dixon, Michael Fisher, Ullrich Hustadt:
Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. TIME 2003: 72-82 - [i1]Anatoli Degtyarev, Michael Fisher, Boris Konev:
Monodic temporal resolution. CoRR cs.LO/0306041 (2003) - 2002
- [j6]Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa:
Equality and Monodic First-Order Temporal Logic. Stud Logica 72(2): 147-156 (2002) - [c20]Alexander V. Lyaletski, Konstantin Verchinine, Anatoli Degtyarev, Andrey Paskevich:
System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities. Intelligent Information Systems 2002: 413-422 - [c19]James Brotherston, Anatoli Degtyarev, Michael Fisher, Alexei Lisitsa:
Searching for Invariants Using Temporal Resolution. LPAR 2002: 86-101 - [c18]Anatoli Degtyarev, Michael Fisher, Boris Konev:
A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic. TABLEAUX 2002: 85-99 - 2001
- [c17]Anatoli Degtyarev, Michael Fisher:
Towards First-Order Temporal Resolution. KI/ÖGAI 2001: 18-32 - [p3]Anatoli Degtyarev, Andrei Voronkov:
The Inverse Method. Handbook of Automated Reasoning 2001: 179-272 - [p2]Anatoli Degtyarev, Andrei Voronkov:
Equality Reasoning in Sequent-Based Calculi. Handbook of Automated Reasoning 2001: 611-706 - [p1]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov:
Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Current Trends in Theoretical Computer Science 2001: 303-326 - 2000
- [j5]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243(1-2): 167-184 (2000) - [c16]Anatoli Degtyarev, Michael Fisher:
Propositional Temporal Resolution Revised. ARW 2000 - [c15]Anatoli Degtyarev, Andrei Voronkov:
Stratified Resolution. CADE 2000: 365-384
1990 – 1999
- 1999
- [c14]Anatoli Degtyarev, Alexander V. Lyaletski, Marina K. Morokhovets:
Evidence Algorithm and Sequent Logical Inference Search. LPAR 1999: 44-61 - 1998
- [j4]Anatoli Degtyarev, Andrei Voronkov:
What You Always Wanted to Know about Rigid E-Unification. J. Autom. Reason. 20(1): 47-80 (1998) - [c13]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195 - 1996
- [j3]Anatoli Degtyarev, Yuri Gurevich, Andrei Voronkov:
Herbrand's Theorem and Equational Reasoning: Problems and Solutions. Bull. EATCS 60: 78-96 (1996) - [j2]Anatoli Degtyarev, Andrei Voronkov:
A Note on Semantics of Logic Programs with Equality Based on Complete Sets of E-Unifiers. J. Log. Program. 28(3): 207-216 (1996) - [j1]Anatoli Degtyarev, Andrei Voronkov:
The Undecidability of Simultaneous Rigid E-Unification. Theor. Comput. Sci. 166(1&2): 291-300 (1996) - [c12]Anatoli Degtyarev, Andrei Voronkov:
Equality Elimination for the Tableau Method. DISCO 1996: 46-60 - [c11]Anatoli Degtyarev, Andrei Voronkov:
Handling Equality in Logic Programming via Basic Folding. ELP 1996: 119-136 - [c10]Anatoli Degtyarev, Andrei Voronkov:
What You Always Wanted to Know About Rigid E-Unification. JELIA 1996: 50-69 - [c9]Anatoli Degtyarev, Yuri V. Matiyasevich, Andrei Voronkov:
Simultaneous E-Unification and Related Algorithmic Problems. LICS 1996: 494-502 - [c8]Anatoli Degtyarev, Andrei Voronkov:
Decidability Problems for the Prenex Fragment of Intuitionistic Logic. LICS 1996: 503-512 - 1995
- [c7]Anatoli Degtyarev, Andrei Voronkov:
Simultaneous Regid E-Unification Is Undecidable. CSL 1995: 178-190 - [c6]Anatoli Degtyarev, Andrei Voronkov:
A New Procedural Interpretation of Horn Clauses with Equality. ICLP 1995: 565-579 - [c5]Anatoli Degtyarev, Andrei Voronkov:
Equality Elimination for the Inverse Method and Extension Procedures. IJCAI 1995: 342-347 - [c4]Anatoli Degtyarev, Andrei Voronkov:
General Connections via Equality Elimination. WOCFAI 1995: 109-120 - 1993
- [c3]Valentin M. Antimirov, Anatoli Degtyarev:
Completeness of Equational Definitions over Predefined Algebras. AMAST 1993: 377-384 - 1992
- [c2]Valentin M. Antimirov, Anatoli Degtyarev:
Consistency and Semantics of Equational Definitions over Predefined Algebras. CTRS 1992: 67-81 - [c1]Valentin M. Antimirov, Anatoli Degtyarev:
Consistency of Equational Enrichments. LPAR 1992: 293-402
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 2025-01-09 12:55 CET 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:
