default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomi Janhunen
Person information
- affiliation: Tampere University, Finland
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c81]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable Classifiers for Tabular Data via Feature Selection and Discretization. DAO-XAI@ECAI 2024- [c80]Anssi Yli-Jyrä
, Heini Ikävalko, Tomi Janhunen:
Integrating Competencies into Preventive Maintenance Scheduling with Answer Set Optimization. FoIKS 2024: 381-400 - [c79]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming. IJCAI 2024: 3369-3376 - [c78]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract). IJCAI 2024: 8399-8404 - [c77]Henry Haverinen, Tomi Janhunen, Tero Päivärinta, Sami Lempinen, Suvi Kaartinen, Sami Merilä:
Automating Cybersecurity Compliance in DevSecOps with Open Information Model for Security as Code. eSAAM 2024: 93-102 - [i18]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable classifiers for tabular data via discretization and feature selection. CoRR abs/2402.05680 (2024) - [i17]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions. CoRR abs/2406.01114 (2024) - 2023
- [j22]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs. Theory Pract. Log. Program. 23(4): 782-796 (2023) - [c76]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. JELIA 2023: 90-105 - [c75]Anssi Yli-Jyrä, Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling. PADL 2023: 279-294 - [c74]Tomi Janhunen:
Generalizing Level Ranking Constraints for Monotone and Convex Aggregates. ICLP 2023: 101-115 - [i16]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs. CoRR abs/2306.05069 (2023) - [i15]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. CoRR abs/2307.06971 (2023) - 2022
- [c73]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. HYDRA/RCRA@LPNMR 2022: 64-77 - [c72]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination. LPNMR 2022: 203-216 - [c71]Tomi Janhunen:
Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo. PADL 2022: 135-153 - [c70]Anssi Yli-Jyrä, Tomi Janhunen:
Applying Answer Set Optimization to Preventive Maintenance Scheduling for Rotating Machinery. RuleML+RR 2022: 3-19 - [c69]Susana Hahn, Tomi Janhunen, Roland Kaminski, Javier Romero, Nicolas Rühling, Torsten Schaub:
Plingo: A System for Probabilistic Reasoning in Clingo Based on LP MLN . RuleML+RR 2022: 54-62 - [i14]Susana Hahn, Tomi Janhunen, Roland Kaminski, Javier Romero, Nicolas Rühling, Torsten Schaub:
plingo: A system for probabilistic reasoning in clingo based on lpmln. CoRR abs/2206.11515 (2022) - [i13]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. CoRR abs/2209.01403 (2022) - 2021
- [j21]Michael Sioutis, Anastasia Paparrizou, Tomi Janhunen:
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning. Inf. Comput. 280: 104638 (2021) - [j20]Jukka Pajunen, Tomi Janhunen:
Solution Enumeration by Optimality in Answer Set Programming. Theory Pract. Log. Program. 21(6): 750-767 (2021) - [c68]Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite:
On Syntactic Forgetting Under Uniform Equivalence. JELIA 2021: 297-312 - [i12]Jukka Pajunen, Tomi Janhunen:
Solution Enumeration by Optimality in Answer Set Programming. CoRR abs/2108.03474 (2021) - 2020
- [j19]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
Declarative encodings of acyclicity properties. J. Log. Comput. 30(4): 923-952 (2020) - [j18]Jori Bomanson, Tomi Janhunen, Ilkka Niemelä:
Applying Visible Strong Equivalence in Answer-Set Program Transformations. ACM Trans. Comput. Log. 21(4): 33:1-33:41 (2020) - [j17]Jori Bomanson, Tomi Janhunen:
Boosting Answer Set Optimization with Weighted Comparator Networks. Theory Pract. Log. Program. 20(4): 512-551 (2020) - [c67]Michael Sioutis, Zhiguo Long, Tomi Janhunen:
On Robustness in Qualitative Constraint Networks. IJCAI 2020: 1813-1819 - [i11]Jori Bomanson, Tomi Janhunen:
Boosting Answer Set Optimization with Weighted Comparator Networks. CoRR abs/2003.03332 (2020)
2010 – 2019
- 2019
- [c66]Jori Bomanson, Tomi Janhunen, Antonius Weinzierl:
Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming. AAAI 2019: 2694-2702 - [c65]Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran:
Forgetting in Modular Answer Set Programming. AAAI 2019: 2843-2850 - [c64]Tomi Janhunen, Michael Sioutis:
Allen's Interval Algebra Makes the Difference. DECLARE 2019: 89-98 - [c63]Michael Sioutis, Tomi Janhunen:
Towards Leveraging Backdoors in Qualitative Constraint Networks. KI 2019: 308-315 - [c62]Flavio Everardo, Tomi Janhunen, Roland Kaminski, Torsten Schaub:
The Return of xorro. LPNMR 2019: 284-297 - [c61]Michael Sioutis, Anastasia Paparrizou, Tomi Janhunen:
On the Utility of Neighbourhood Singleton-Style Consistencies for Qualitative Constraint-Based Spatial and Temporal Reasoning. TIME 2019: 14:1-14:17 - [i10]Tomi Janhunen, Michael Sioutis:
Allen's Interval Algebra Makes the Difference. CoRR abs/1909.01128 (2019) - 2018
- [j16]Tomi Janhunen:
Answer Set Programming - Related with Other Solving Paradigms. Künstliche Intell. 32(2-3): 125-131 (2018) - [j15]Tomi Janhunen:
Cross-Translating Answer Set Programs Using the ASPTOOLS Collection. Künstliche Intell. 32(2-3): 183-184 (2018) - [c60]Jori Bomanson, Tomi Janhunen, Antonius Weinzierl:
Towards Lazy Grounding with Lazy Normalization in Answer-Set Programming - Extended Abstract. KR 2018: 625-626 - [c59]Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite, Stefan Woltran:
Variable Elimination for DLP-Functions. KR 2018: 643-644 - 2017
- [j14]Tomi Janhunen, Martin Gebser, Jussi Rintanen, Henrik J. Nyman, Johan Pensar, Jukka Corander:
Learning discrete decomposable graphical models via constraint optimization. Stat. Comput. 27(1): 115-130 (2017) - [j13]Tomi Janhunen, Roland Kaminski, Max Ostrowski, Sebastian Schellhorn, Philipp Wanko, Torsten Schaub:
Clingo goes linear constraints over reals and integers. Theory Pract. Log. Program. 17(5-6): 872-888 (2017) - [c58]Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko:
clingo goes Linear Constraints over Reals and Integers. ASPOCP@LPNMR 2017 - [e2]Marcello Balduccini, Tomi Janhunen:
Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Espoo, Finland, July 3-6, 2017, Proceedings. Lecture Notes in Computer Science 10377, Springer 2017, ISBN 978-3-319-61659-9 [contents] - [i9]Tomi Janhunen, Roland Kaminski, Max Ostrowski, Torsten Schaub, Sebastian Schellhorn, Philipp Wanko:
Clingo goes Linear Constraints over Reals and Integers. CoRR abs/1707.04053 (2017) - 2016
- [j12]Tomi Janhunen, Ilkka Niemelä:
The Answer Set Programming Paradigm. AI Mag. 37(3): 13-24 (2016) - [j11]Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub:
Answer Set Programming Modulo Acyclicity. Fundam. Informaticae 147(1): 63-91 (2016) - [j10]Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
Stable-unstable semantics: Beyond NP with normal logic programs. Theory Pract. Log. Program. 16(5-6): 570-586 (2016) - [c57]Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
Solving QBF Instances with Nested SAT Solvers. AAAI Workshop: Beyond NP 2016 - [c56]Tomi Janhunen, Shahab Tasharrofi, Eugenia Ternovska:
SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators. AAAI 2016: 978-984 - [c55]Jori Bomanson, Martin Gebser, Tomi Janhunen:
Rewriting Optimization Statements in Answer-Set Programs. ICLP (Technical Communications) 2016: 5:1-5:15 - [c54]Martin Gebser, Tomi Janhunen, Roland Kaminski, Torsten Schaub, Shahab Tasharrofi:
Writing Declarative Specifications for Clauses. JELIA 2016: 256-271 - [c53]Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
Declarative Solver Development: Case Studies. KR 2016: 74-83 - [c52]Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
SAT-to-SAT in QBFEval 2016. QBF@SAT 2016: 63-70 - [i8]Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
Stable-Unstable Semantics: Beyond NP with Normal Logic Programs. CoRR abs/1608.01835 (2016) - 2015
- [j9]Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä:
Optimizing phylogenetic supertrees using answer set programming. Theory Pract. Log. Program. 15(4-5): 604-619 (2015) - [c51]Tomi Janhunen, Ilkka Niemelä:
Cumulativity Tailored for Nonmonotonic Reasoning. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 96-111 - [c50]Indre Zliobaite, Michael Mathioudakis, Tuukka Lehtiniemi, Pekka Parviainen, Tomi Janhunen:
Accessibility by Public Transport Predicts Residential Real Estate Prices: A Case Study in Helsinki Region. MUD@ICML 2015: 65-71 - [c49]Jori Bomanson, Martin Gebser, Tomi Janhunen, Benjamin Kaufmann, Torsten Schaub:
Answer Set Programming Modulo Acyclicity. LPNMR 2015: 143-150 - [c48]Martin Gebser, Tomi Janhunen, Holger Jost, Roland Kaminski, Torsten Schaub:
ASP Solving for Expanding Universes. LPNMR 2015: 354-367 - [i7]Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä:
Optimizing Phylogenetic Supertrees Using Answer Set Programming. CoRR abs/1507.05272 (2015) - 2014
- [c47]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
Answer Set Programming as SAT modulo Acyclicity. ECAI 2014: 351-356 - [c46]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
SAT Modulo Graphs: Acyclicity. JELIA 2014: 137-151 - [c45]Jori Bomanson, Martin Gebser, Tomi Janhunen:
Improving the Normalization of Weight Rules in Answer Set Programs. JELIA 2014: 166-180 - [c44]Martin Gebser, Tomi Janhunen, Jussi Rintanen:
ASP Encodings of Acyclicity Properties. KR 2014 - [i6]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. CoRR abs/1401.3484 (2014) - 2013
- [c43]Guohua Liu, Tomi Janhunen, Ilkka Niemelä:
Introducing Real Variables and Integer Objective Functions to Answer Set Programming. KDPD 2013: 118-135 - [c42]Jori Bomanson, Tomi Janhunen:
Normalizing Cardinality Rules Using Merging and Sorting Constructions. LPNMR 2013: 187-199 - [c41]Jukka Corander, Tomi Janhunen, Jussi Rintanen, Henrik J. Nyman, Johan Pensar:
Learning Chordal Markov Networks by Constraint Satisfaction. NIPS 2013: 1349-1357 - [i5]Jukka Corander, Tomi Janhunen, Jussi Rintanen, Henrik J. Nyman, Johan Pensar:
Learning Chordal Markov Networks by Constraint Satisfaction. CoRR abs/1310.0927 (2013) - 2012
- [c40]Tomi Janhunen, Ilkka Niemelä:
Applying Visible Strong Equivalence in Answer-Set Program Transformations. Correct Reasoning 2012: 363-379 - [c39]Guohua Liu, Tomi Janhunen, Ilkka Niemelä:
Answer Set Programming via Mixed Integer Programming. KR 2012 - [c38]Tomi Janhunen, Vesa Luukkala:
Meta Programming with Answer Sets for Smart Spaces. RR 2012: 106-121 - 2011
- [c37]Tomi Janhunen, Ilkka Niemelä:
Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 111-130 - [c36]Mai Nguyen, Tomi Janhunen, Ilkka Niemelä:
Translating Answer-Set Programs into Bit-Vector Logic. INAP/WLP 2011: 95-113 - [c35]Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You:
Strong Equivalence of Logic Programs with Abstract Constraint Atoms. LPNMR 2011: 161-173 - [c34]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits:
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison. LPNMR 2011: 242-247 - [c33]Rehan Abdul Aziz, Tomi Janhunen, Vesa Luukkala:
Distributed Deadlock Handling for Resource Allocation in Smart Spaces. NEW2AN 2011: 87-98 - [i4]Mai Nguyen, Tomi Janhunen, Ilkka Niemelä:
Translating Answer-Set Programs into Bit-Vector Logic. CoRR abs/1108.5837 (2011) - 2010
- [c32]Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch, Jörg Pührer, Hans Tompits:
On Testing Answer-Set Programs. ECAI 2010: 951-956 - [c31]Tomi Janhunen:
Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited. ICLP (Technical Communications) 2010: 94-103 - [e1]Tomi Janhunen, Ilkka Niemelä:
Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6341, Springer 2010, ISBN 978-3-642-15674-8 [contents]
2000 – 2009
- 2009
- [j8]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. J. Artif. Intell. Res. 35: 813-857 (2009) - [j7]Emilia Oikarinen, Tomi Janhunen:
A Translation-based Approach to the Verification of Modular Equivalence. J. Log. Comput. 19(4): 591-613 (2009) - [c30]Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev:
Computing Stable Models via Reductions to Difference Logic. LPNMR 2009: 142-154 - [c29]Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä:
A Module-Based Framework for Multi-language Constraint Modeling. LPNMR 2009: 155-168 - 2008
- [j6]Emilia Oikarinen, Tomi Janhunen:
Achieving compositionality of the stable model semantics for smodels programs. Theory Pract. Log. Program. 8(5-6): 717-761 (2008) - [c28]Emilia Oikarinen, Tomi Janhunen:
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. AIMSA 2008: 167-180 - [c27]Tomi Janhunen:
Modular Equivalence in General. ECAI 2008: 75-79 - [c26]Tomi Janhunen:
Removing Redundancy from Answer Set Programs. ICLP 2008: 729-733 - [i3]Emilia Oikarinen, Tomi Janhunen:
Achieving compositionality of the stable model semantics for Smodels programs. CoRR abs/0809.4582 (2008) - 2007
- [j5]Tomi Janhunen, Emilia Oikarinen:
Automated Verification of Weak Equivalence within the SMODELS System. Theory Pract. Log. Program. 7(6): 697-744 (2007) - [c25]Emilia Oikarinen, Tomi Janhunen:
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. ICLP 2007: 440-441 - [c24]Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran:
Modularity Aspects of Disjunctive Stable Models. LPNMR 2007: 175-187 - 2006
- [j4]Tomi Janhunen:
Some (in)translatability results for normal logic programs and propositional theories. J. Appl. Non Class. Logics 16(1-2): 35-86 (2006) - [j3]Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You:
Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Log. 7(1): 1-37 (2006) - [c23]Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy:
On Probing and Multi-Threading in Platypus. ECAI 2006: 392-396 - [c22]Emilia Oikarinen, Tomi Janhunen:
Modular Equivalence for Normal Logic Programs. ECAI 2006: 412-416 - [c21]Christian Anger, Martin Gebser, Tomi Janhunen, Torsten Schaub:
What's a Head Without a Body? ECAI 2006: 769-770 - [i2]Tomi Janhunen, Emilia Oikarinen:
Automated verification of weak equivalence within the SMODELS system. CoRR abs/cs/0608099 (2006) - 2005
- [c20]Jean Gressmann, Tomi Janhunen, Robert E. Mercer, Torsten Schaub, Sven Thiele, Richard Tichy:
Platypus: A Platform for Distributed Answer Set Solving. LPNMR 2005: 227-239 - [c19]Emilia Oikarinen, Tomi Janhunen:
circ2dlp - Translating Circumscription into Disjunctive Logic Programming. LPNMR 2005: 405-409 - 2004
- [c18]Tomi Janhunen:
Representing Normal Programs with Clauses. ECAI 2004: 358-362 - [c17]Tomi Janhunen, Emilia Oikarinen:
Capturing Parallel Circumscription with Disjunctive Logic Programs. JELIA 2004: 134-146 - [c16]Emilia Oikarinen, Tomi Janhunen:
Verifying the Equivalence of Logic Programs in the Disjunctive Case. LPNMR 2004: 180-193 - [c15]Tomi Janhunen, Ilkka Niemelä:
GNT - A Solver for Disjunctive Logic Programs. LPNMR 2004: 331-335 - [c14]Tomi Janhunen, Emilia Oikarinen:
LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. LPNMR 2004: 336-340 - 2003
- [j2]Tomi Janhunen:
Evaluating the effect of semi-normality on the expressiveness of defaults. Artif. Intell. 144(1-2): 233-250 (2003) - [c13]Tomi Janhunen:
A Counter-Based Approach to Translating Normal Logic Programs into Sets of Clauses. Answer Set Programming 2003 - [i1]Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You:
Unfolding Partiality and Disjunctions in Stable Model Semantics. CoRR cs.AI/0303009 (2003) - 2002
- [c12]Tomi Janhunen, Emilia Oikarinen:
Testing the Equivalence of Logic Programs under Stable Model Semantics. JELIA 2002: 493-504 - 2001
- [c11]Tomi Janhunen:
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. LPNMR 2001: 93-106 - 2000
- [c10]Tomi Janhunen:
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs. Computational Logic 2000: 852-866 - [c9]Tomi Janhunen:
Capturing Stationary and Regular Extensions with Reiter's Extensions. JELIA 2000: 102-117 - [c8]Tomi Janhunen, Ilkka Niemelä, Patrik Simons, Jia-Huai You:
Unfolding Partiality and Disjunctions in Stable Model Semantics. KR 2000: 411-422
1990 – 1999
- 1999
- [j1]Tomi Janhunen:
On the intertranslatability of non-monotonic logics. Ann. Math. Artif. Intell. 27(1-4): 79-128 (1999) - [c7]Tomi Janhunen:
Classifying Semi-Normal Default Logic on the Basis of its Expressive Power. LPNMR 1999: 19-33 - 1998
- [c6]Tomi Janhunen:
On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription. JELIA 1998: 216-232 - 1997
- [c5]Tomi Janhunen:
Separating Disbeliefs from Beliefs in Autoepistemic Reasoning. LPNMR 1997: 132-151 - 1996
- [c4]Tomi Janhunen:
Representing Autoepistemic Introspection in Terms of Default Rules. ECAI 1996: 70-74 - 1995
- [c3]Tomi Janhunen:
Cautious Models for General Logic Programs. Deductive Databases / Abduction in Deductive Databases 1995: 25-39 - 1993
- [c2]Tomi Janhunen, Ilkka Niemelä:
A Scheme for Weakened Negative Introspection in Autoepistemic Reasoning. Kurt Gödel Colloquium 1993: 211-222 - 1992
- [c1]Matti Hallivuori, Tomi Janhunen, Tapio Suihko:
A Graphical User Interface for a Value Added Network. INDC 1992: 293-307
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-03-04 22:11 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:
