default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSalvador Lucas
Person information
- affiliation: Polytechnic University of Valencia, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Raúl Gutiérrez, Salvador Lucas, Miguel Vítores:
Proving Confluence in the Confluence Framework with CONFident. Fundam. Informaticae 192(2): 167-217 (2024)- [j33]Salvador Lucas
:
Local confluence of conditional and generalized term rewriting systems. J. Log. Algebraic Methods Program. 136: 100926 (2024) - [c95]Salvador Lucas:
Confluence of Conditional Rewriting Modulo. CSL 2024: 37:1-37:21 - [c94]Salvador Lucas:
Termination of Generalized Term Rewriting Systems. FSCD 2024: 32:1-32:18 - 2023
- [i6]Raúl Gutiérrez, Salvador Lucas, Miguel Vítores:
Proving Confluence in the Confluence Framework with CONFident. CoRR abs/2306.16330 (2023) - 2022
- [j32]Salvador Lucas, Miguel Vítores, Raúl Gutiérrez:
Proving and disproving confluence of context-sensitive rewriting. J. Log. Algebraic Methods Program. 126: 100749 (2022) - [c93]Raúl Gutiérrez, Miguel Vítores, Salvador Lucas:
Confluence Framework: Proving Confluence with CONFident. LOPSTR 2022: 24-43 - 2021
- [j31]Salvador Lucas:
Context-sensitive Rewriting. ACM Comput. Surv. 53(4): 78:1-78:36 (2021) - [j30]Salvador Lucas:
Derivational Complexity and Context-Sensitive Rewriting. J. Autom. Reason. 65(8): 1191-1229 (2021) - [j29]Salvador Lucas:
Applications and extensions of context-sensitive rewriting. J. Log. Algebraic Methods Program. 121: 100680 (2021) - [j28]Salvador Lucas:
The origins of the halting problem. J. Log. Algebraic Methods Program. 121: 100687 (2021) - [c92]Raúl Gutiérrez, Salvador Lucas, Miguel Vítores:
Confluence of Conditional Rewriting in Logic Form. FSTTCS 2021: 44:1-44:18 - 2020
- [j27]Salvador Lucas:
Using Well-Founded Relations for Proving Operational Termination. J. Autom. Reason. 64(2): 167-195 (2020) - [j26]Salvador Lucas, José Meseguer, Raúl Gutiérrez:
The 2D Dependency Pair Framework for Conditional Rewrite Systems - Part II: Advanced Processors and Implementation Techniques. J. Autom. Reason. 64(8): 1611-1662 (2020) - [c91]Raúl Gutiérrez, Salvador Lucas:
Automatically Proving and Disproving Feasibility Conditions. IJCAR (2) 2020: 416-435 - [c90]Raúl Gutiérrez, Salvador Lucas:
mu-term: Verify Termination Properties Automatically (System Description). IJCAR (2) 2020: 436-447 - [c89]Salvador Lucas:
Proving Semantic Properties as First-Order Satisfiability (Extended Abstract). IJCAI 2020: 5075-5079
2010 – 2019
- 2019
- [j25]Salvador Lucas:
Proving semantic properties as first-order satisfiability. Artif. Intell. 277 (2019) - [c88]Raúl Gutiérrez, Salvador Lucas:
Automatic Generation of Logical Models with AGES. CADE 2019: 287-299 - 2018
- [j24]Salvador Lucas, Raúl Gutiérrez:
Use of logical models for proving infeasibility in term rewriting. Inf. Process. Lett. 136: 90-95 (2018) - [j23]Salvador Lucas, Raúl Gutiérrez:
Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories. J. Autom. Reason. 60(4): 465-501 (2018) - [j22]Salvador Lucas, José Meseguer, Raúl Gutiérrez:
The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors. J. Comput. Syst. Sci. 96: 74-106 (2018) - [c87]Salvador Lucas:
Proving Program Properties as First-Order Satisfiability. LOPSTR 2018: 3-21 - [i5]Salvador Lucas:
Proving Program Properties as First-Order Satisfiability. CoRR abs/1808.04111 (2018) - 2017
- [j21]Salvador Lucas, José Meseguer:
Dependency pairs for proving termination properties of conditional term rewriting systems. J. Log. Algebraic Methods Program. 86(1): 236-268 (2017) - [c86]Salvador Lucas:
Analysis of Rewriting-Based Systems as First-Order Theories. LOPSTR 2017: 180-197 - [i4]Salvador Lucas:
A Semantic Approach to the Analysis of Rewriting-Based Systems. CoRR abs/1709.05095 (2017) - 2016
- [j20]Salvador Lucas, José Meseguer:
Normal forms and normal theories in conditional rewriting. J. Log. Algebraic Methods Program. 85(1): 67-97 (2016) - [c85]Salvador Lucas:
Use of Logical Models for Proving Operational Termination in General Logics. WRLA 2016: 26-46 - 2015
- [j19]Salvador Lucas:
Completeness of context-sensitive rewriting. Inf. Process. Lett. 115(2): 87-92 (2015) - [c84]Salvador Lucas, José Meseguer:
Localized Operational Termination in General Logics. Software, Services, and Systems 2015: 91-114 - [c83]Raúl Gutiérrez, Salvador Lucas:
Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting. Logic, Rewriting, and Concurrency 2015: 311-330 - [c82]Salvador Lucas:
Termination of canonical context-sensitive rewriting and productivity of rewrite systems. PROLE 2015: 18-31 - [c81]Salvador Lucas:
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving. PROLE 2015: 32-47 - 2014
- [c80]Salvador Lucas, José Meseguer:
Models for Logics and Conditional Constraints in Automated Proofs of Termination. AISC 2014: 9-20 - [c79]Salvador Lucas:
Using Representation Theorems for Proving Polynomials Non-negative. AISC 2014: 21-33 - [c78]Salvador Lucas, José Meseguer, Raúl Gutiérrez:
Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems. LOPSTR 2014: 113-130 - [c77]Salvador Lucas, José Meseguer:
Proving Operational Termination of Declarative Programs in General Logics. PPDP 2014: 111-122 - [c76]Salvador Lucas, José Meseguer:
Strong and Weak Operational Termination of Order-Sorted Rewrite Theories. WRLA 2014: 178-194 - [c75]Salvador Lucas, José Meseguer:
2D Dependency Pairs for Proving Operational Termination of CTRSs. WRLA 2014: 195-212 - 2012
- [j18]Cristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio:
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints. J. Autom. Reason. 48(1): 107-131 (2012) - 2010
- [j17]Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas:
Context-sensitive dependency pairs. Inf. Comput. 208(8): 922-968 (2010) - [j16]María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas:
On-demand strategy annotations revisited: An improved on-demand evaluation strategy. Theor. Comput. Sci. 411(2): 504-541 (2010) - [c74]Salvador Lucas:
From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals. AISC/MKM/Calculemus 2010: 116-131 - [c73]Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset:
Proving Termination Properties with mu-term. AMAST 2010: 201-208 - [c72]Raúl Gutiérrez, Salvador Lucas:
Proving Termination in the Context-Sensitive Dependency Pair Framework. WRLA 2010: 18-34 - [c71]Beatriz Alarcón, Salvador Lucas, José Meseguer:
A Dependency Pair Framework for A OR C-Termination. WRLA 2010: 35-51 - [i3]Salvador Lucas:
From matrix interpretations over the rationals to matrix interpretations over the naturals. CoRR abs/1007.0143 (2010)
2000 – 2009
- 2009
- [c70]Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio:
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. CADE 2009: 294-305 - [c69]Francisco Durán, Salvador Lucas, José Meseguer:
Termination Modulo Combinations of Equational Theories. FroCoS 2009: 246-262 - [c68]Salvador Lucas:
Automatic Proofs of Termination With Elementary Interpretations. PROLE 2009: 41-61 - 2008
- [j15]Salvador Lucas, José Meseguer:
Termination of just/fair computations in term rewriting. Inf. Comput. 206(5): 652-675 (2008) - [j14]Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain:
Proving operational termination of membership equational programs. High. Order Symb. Comput. 21(1-2): 59-88 (2008) - [c67]Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp:
Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus 2008: 109-124 - [c66]Francisco Durán, Salvador Lucas, José Meseguer:
MTT: The Maude Termination Tool (System Description). IJCAR 2008: 313-319 - [c65]Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann:
Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651 - [c64]Salvador Lucas, José Meseguer:
Order-sorted dependency pairs. PPDP 2008: 108-119 - [c63]Raúl Gutiérrez, Salvador Lucas, Xavier Urbain:
Usable Rules for Context-Sensitive Rewrite Systems. RTA 2008: 126-141 - [c62]Beatriz Alarcón, Salvador Lucas:
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting. PROLE 2008: 3-17 - [c61]Francisco Durán, Salvador Lucas, José Meseguer, Francisco Gutiérrez:
Web Services and Interoperability for the Maude Termination Tool. PROLE 2008: 83-92 - [c60]Francisco Durán, Salvador Lucas, José Meseguer:
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation. PROLE 2008: 93-113 - [c59]Salvador Lucas, José Meseguer:
Operational Termination of Membership Equational Programs: the Order-Sorted Way. WRLA 2008: 207-225 - 2007
- [j13]María Alpuente, Santiago Escobar, Salvador Lucas:
Removing redundant arguments automatically. Theory Pract. Log. Program. 7(1-2): 3-35 (2007) - [c58]Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, Peter Csaba Ölveczky:
The Maude Formal Tool Environment. CALCO 2007: 173-178 - [c57]Beatriz Alarcón, Salvador Lucas:
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. FroCoS 2007: 73-87 - [c56]Salvador Lucas:
Practical use of polynomials over the reals in proofs of termination. PPDP 2007: 39-50 - [c55]Salvador Lucas, Rafael Navarro-Marset:
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers. PROLE 2007: 75-90 - [c54]Sonia Flores, Salvador Lucas, Alicia Villanueva:
Formal Verification of Websites. WWV 2007: 103-118 - 2006
- [j12]Salvador Lucas:
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Appl. Algebra Eng. Commun. Comput. 17(1): 49-73 (2006) - [j11]Salvador Lucas:
Proving termination of context-sensitive rewriting by transformation. Inf. Comput. 204(12): 1782-1846 (2006) - [c53]Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas:
Context-Sensitive Dependency Pairs. FSTTCS 2006: 297-308 - [c52]Bernhard Gramlich, Salvador Lucas:
Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA 2006: 66-80 - [c51]Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas:
Improving the Context-sensitive Dependency Graph. PROLE 2006: 91-103 - [c50]Beatriz Alarcón, Raúl Gutiérrez, José Iborra, Salvador Lucas:
Proving Termination of Context-Sensitive Rewriting with MU-TERM. PROLE 2006: 105-115 - [i2]María Alpuente, Santiago Escobar, Salvador Lucas:
Removing Redundant Arguments Automatically. CoRR abs/cs/0601039 (2006) - 2005
- [j10]Salvador Lucas, Claude Marché, José Meseguer:
Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4): 446-453 (2005) - [j9]Salvador Lucas:
Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theor. Informatics Appl. 39(3): 547-586 (2005) - [j8]Bernhard Gramlich, Salvador Lucas:
Reduction strategies in rewriting and programming. J. Symb. Comput. 40(1): 745-747 (2005) - [j7]María Alpuente, Salvador Lucas, Michael Hanus, Germán Vidal:
Specialization of functional logic programs based on needed narrowing. Theory Pract. Log. Program. 5(3): 273-303 (2005) - [c49]Salvador Lucas, José Meseguer:
Termination of Fair Computations in Term Rewriting. LPAR 2005: 184-198 - [c48]Salvador Lucas:
Rewriting-based navigation of Web sites. WWV 2005: 157-160 - [c47]Salvador Lucas:
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics. WWV 2005: 79-85 - [e4]Salvador Lucas:
Proceedings of the Fourth Spanish Conference on Programming and Computer Languages, PROLE 2004, Málaga, Spain, November 10-12, 2004. Electronic Notes in Theoretical Computer Science 137(1), Elsevier 2005 [contents] - 2004
- [j6]Salvador Lucas:
Strong and NV-sequentiality of constructor systems. Inf. Process. Lett. 89(4): 191-201 (2004) - [c46]Salvador Lucas:
Polynomials for Proving Termination of Context-Sensitive Rewriting. FoSSaCS 2004: 318-332 - [c45]Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain:
Proving termination of membership equational programs. PEPM 2004: 147-158 - [c44]Salvador Lucas:
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. RTA 2004: 200-209 - [c43]Salvador Lucas:
Preface. PROLE 2004: 1-3 - [c42]Francisco Durán, Santiago Escobar, Salvador Lucas:
On-demand Evaluation for Maude. RULE@RDP 2004: 25-39 - [c41]Salvador Lucas:
Strategies in Programming Languages Today. WRS 2004: 113-118 - [c40]Francisco Durán, Santiago Escobar, Salvador Lucas:
New Evaluation Commands for Maude Within Full Maude. WRLA 2004: 263-284 - [i1]María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal:
Specialization of Functional Logic Programs Based on Needed Narrowing. CoRR cs.PL/0403011 (2004) - 2003
- [c39]María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas:
Abstract Correction of OBJ-like Programs. APPIA-GULP-PRODE 2003: 422-433 - [c38]María Alpuente, Santiago Escobar, Salvador Lucas:
OnDemandOBJ: A Laboratory for Strategy Annotations. RULE@RDP 2003: 1-27 - [c37]María Alpuente, Santiago Escobar, Salvador Lucas:
On-demand Evaluation by Program Transformation. RULE@RDP 2003: 92-118 - [c36]María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas:
Abstract correction of first-order functional programs. WFLP 2003: 105-122 - [c35]Bernhard Gramlich, Salvador Lucas:
Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. WRS 2003: 567-569 - [e3]Bernhard Gramlich, Salvador Lucas:
3rd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2003, Valencia, Spain, June 8, 2003, Final Proceedings. Electronic Notes in Theoretical Computer Science 86(4), Elsevier 2003 [contents] - 2002
- [j5]Salvador Lucas:
Context-Sensitive Rewriting Strategies. Inf. Comput. 178(1): 294-343 (2002) - [c34]María Alpuente, Santiago Escobar, Salvador Lucas:
Removing Redundant Arguments of Functions. AMAST 2002: 117-131 - [c33]Cristina Borralleras, Salvador Lucas, Albert Rubio:
Recursive Path Orderings Can Be Context-Sensitive. CADE 2002: 314-331 - [c32]María Alpuente, Marco Comini, Santiago Escobar, Moreno Falaschi, Salvador Lucas:
Abstract Diagnosis of Functional Programs. LOPSTR 2002: 1-16 - [c31]María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas:
Improving On-Demand Strategy Annotations. LPAR 2002: 1-18 - [c30]Bernhard Gramlich, Salvador Lucas:
Modular termination of context-sensitive rewriting. PPDP 2002: 50-61 - [c29]Salvador Lucas:
Termination of (Canonical) Context-Sensitive Rewriting. RTA 2002: 296-310 - [c28]Bernhard Gramlich, Salvador Lucas:
Simple termination of context-sensitive rewriting. ACM SIGPLAN Workshop on Rule-Based Programming 2002: 29-42 - [c27]María Alpuente, Rachid Echahed, Santiago Escobar, Salvador Lucas:
Redundancy of Arguments Reduced to Induction. WFLP 2002: 20-41 - [c26]Sergio Antoy, Salvador Lucas:
Demandness in Rewriting and Narrowing. WFLP 2002: 42-51 - [c25]María Alpuente, Santiago Escobar, Salvador Lucas:
Correct and Complete (Positive) Strategy Annotations for OBJ. WRLA 2002: 70-89 - [c24]Bernhard Gramlich, Salvador Lucas:
Preface. WRS 2002: 196-197 - [e2]Bernhard Gramlich, Salvador Lucas:
2nd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2002, FLoC Satellite Event, Copenhagen, Denmark, July 21, 2002, Final Proceedings. Electronic Notes in Theoretical Computer Science 70(6), Elsevier 2002 [contents] - 2001
- [j4]Michael Hanus, Salvador Lucas:
An Evaluation Semantics for Narrowing-Based Functional Logic Languages. J. Funct. Log. Program. 2001(2) (2001) - [c23]Salvador Lucas:
Termination of Rewriting With Strategy Annotations. LPAR 2001: 669-684 - [c22]Salvador Lucas:
Termination of On-Demand Rewriting and Termination of OBJ Programs. PPDP 2001: 82-93 - [c21]Salvador Lucas:
Transfinite Rewriting Semantics for Term Rewriting Systems. RTA 2001: 216-230 - [c20]Salvador Lucas:
Lazy Rewriting and Context-Sensitive Rewriting. WFLP 2001: 234-254 - [c19]Bernhard Gramlich, Salvador Lucas:
1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. WRS 2001: 201-202 - [e1]Bernhard Gramlich, Salvador Lucas:
1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001, Utrecht, The Netherlands, May 26, 2001. Electronic Notes in Theoretical Computer Science 57, Elsevier 2001 [contents] - 2000
- [c18]Salvador Lucas:
Strong and NV-sequentiality of constructor systems. WFLP 2000: 253-267 - [c17]María Alpuente, Santiago Escobar, Salvador Lucas:
Redundancy Analyses in Term Rewriting. WFLP 2000: 309-323 - [c16]Salvador Lucas:
Redundant arguments in infinitary rewriting. WFLP 2000: 340-343
1990 – 1999
- 1999
- [c15]María Alpuente, Salvador Lucas, Santiago Escobar:
An Incremental Needed Narrowing Calculus for Curry. APPIA-GULP-PRODE 1999: 75-88 - [c14]Michael Hanus, Salvador Lucas:
A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages. Fuji International Symposium on Functional and Logic Programming 1999: 353-368 - [c13]María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal:
Specialization of Inductively Sequential Functional Logic Programs. ICFP 1999: 273-283 - [c12]María Alpuente, Santiago Escobar, Salvador Lucas:
UPV-CURRY: An Incremental CURRY Interpreter. SOFSEM 1999: 331-339 - 1998
- [j3]Michael Hanus, Salvador Lucas, Aart Middeldorp:
Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. 67(1): 1-8 (1998) - [j2]Salvador Lucas:
Root-Neededness and Approximations of Neededness. Inf. Process. Lett. 67(5): 245-254 (1998) - [j1]Salvador Lucas:
Context-sensitive Computations in Functional and Functional Logic Programs. J. Funct. Log. Program. 1998(1) (1998) - 1997
- [c11]Salvador Lucas:
Computational Properties of Term Rewriting with Replacement Restrictions. APPIA-GULP-PRODE 1997: 393-404 - [c10]Salvador Lucas:
Needed Reductions with Context-Sensitive Rewriting. ALP/HOA 1997: 129-143 - [c9]Salvador Lucas:
Transformations for Efficient Evaluations in Functional Programming. PLILP 1997: 127-141 - [c8]Salvador Lucas:
Efficient Strong Sequentiality Using Replacement Restrictions. SOFSEM 1997: 489-496 - 1996
- [c7]Michael Hanus, Salvador Lucas:
A Denotational Semantics for Needed Narrowing. APPIA-GULP-PRODE 1996: 259-270 - [c6]Salvador Lucas:
Termination of Context-Sensitive Rewriting by Rewriting. ICALP 1996: 122-133 - [c5]Salvador Lucas:
Context-Sensitive Computations in Confluent Programs. PLILP 1996: 408-422 - [c4]Salvador Lucas, Javier Oliver:
A New Proposal of Concurrent Process Calculus. SOFSEM 1996: 385-392 - 1995
- [c3]Salvador Lucas:
Computational Properties in Context-Sensitive Rewriting. GULP-PRODE 1995: 435-446 - [c2]Salvador Lucas:
Fundamentals of Context=Sensitive Rewriting. SOFSEM 1995: 405-412 - 1994
- [c1]Salvador Lucas, Javier Oliver:
El lambda-calculo Etiquetado Paralelo (LCEP). GULP-PRODE (1) 1994: 125-139
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-10-04 20:58 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:
