default search action
Michael J. Maher
Person information
- affiliation: Reasoning Research Institute, Canberra, Australia
- affiliation: University of New South Wales, Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i16]Michael J. Maher:
Which are the True Defeasible Logics? CoRR abs/2405.19157 (2024) - 2023
- [j41]Thomas Eiter
, Michael J. Maher
The Collection of Papers Celebrating the 20th Anniversary of TPLP, Part II. Theory Pract. Log. Program. 23(1): 1 (2023) - [j40]Michael J. Maher
Defeasible Reasoning via Datalog¬. Theory Pract. Log. Program. 23(5): 986-1028 (2023) - 2022
- [j39]Michael J. Maher
On Signings and the Well-Founded Semantics. Theory Pract. Log. Program. 22(1): 115-127 (2022) - [j38]Thomas Eiter
Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP. Theory Pract. Log. Program. 22(6): 770-775 (2022) - 2021
- [j37]Guido Governatori, Michael J. Maher, Francesco Olivieri:
Strategic Argumentation. FLAP 8(6): 1679-1748 (2021) - [c82]Ron van der Meyden, Michael J. Maher:
Architecture for Smart SAFE Contracts. BRAINS 2021: 145-148 - [i15]Michael J. Maher:
On Signings and the Well-Founded Semantics. CoRR abs/2102.06495 (2021) - [i14]Michael J. Maher:
Relative Expressiveness of Defeasible Logics II. CoRR abs/2102.10532 (2021) - [i13]Michael J. Maher:
Defeasible Reasoning via Datalog¬. CoRR abs/2106.10946 (2021) - [i12]Michael J. Maher:
Approximating Defeasible Logics to Improve Scalability. CoRR abs/2108.05232 (2021) - 2020
- [j36]Michael J. Maher, Ilias Tachmazidis
Rethinking Defeasible Reasoning: A Scalable Approach. Theory Pract. Log. Program. 20(4): 552-586 (2020) - [i11]Michael J. Maher, Ilias Tachmazidis, Grigoris Antoniou, Stephen J. Wade, Long Cheng:
Rethinking Defeasible Reasoning: A Scalable Approach. CoRR abs/2001.00406 (2020) - [i10]Michael J. Maher:
A lemma on closures and its application to modularity in logic programming semantics. CoRR abs/2008.00724 (2020) - [i9]Michael J. Maher:
Corruption and Audit in Strategic Argumentation. CoRR abs/2008.13115 (2020)
2010 – 2019
- 2018
- [c81]Masoumeh Tajvidi, Daryl Essam, Michael J. Maher:
Deadline-constrained Stochastic Optimization of Resource Provisioning, for Cloud Users. CLOSER 2018: 179-189 - 2017
- [j35]Michael J. Maher:
Relating Concrete Defeasible Reasoning Formalisms and Abstract Argumentation. Fundam. Informaticae 155(3): 233-260 (2017) - [j34]Michael J. Maher:
Contractibility for open global constraints. Theory Pract. Log. Program. 17(4): 365-407 (2017) - [j33]Guido Governatori
Annotated defeasible logic. Theory Pract. Log. Program. 17(5-6): 819-836 (2017) - [c80]Masoumeh Tajvidi, Michael J. Maher, Daryl Essam:
Uncertainty-aware Optimization of Resource Provisioning, a Cloud End-user Perspective. CLOSER 2017: 293-300 - [i8]Michael J. Maher:
Contractibility for Open Global Constraints. CoRR abs/1702.07889 (2017) - [i7]Guido Governatori, Michael J. Maher:
Annotated Defeasible Logic. CoRR abs/1707.04734 (2017) - 2016
- [c79]Michael J. Maher:
Resistance to Corruption of Strategic Argumentation. AAAI 2016: 1030-1036 - [c78]Michael J. Maher:
Corrupt Strategic Argumentation: The Ideal and the Naive. Australasian Conference on Artificial Intelligence 2016: 17-28 - [c77]Michael J. Maher:
Resistance to Corruption of General Strategic Argumentation. PRIMA 2016: 61-75 - 2015
- [j32]Mohiuddin Ahmed, Adnan Anwar
An Investigation of Performance Analysis of Anomaly Detection Techniques for Big Data in SCADA Systems. EAI Endorsed Trans. Ind. Networks Intell. Syst. 2(3): e5 (2015) - [j31]Mohiuddin Ahmed, Abdun Naser Mahmood, Michael J. Maher:
An Efficient Technique for Network Traffic Summarization using Multiview Clustering and Statistical Sampling. EAI Endorsed Trans. Scalable Inf. Syst. 2(5): e4 (2015) - [c76]Michael J. Maher:
Relating Concrete Argumentation Formalisms and Abstract Argumentation. ICLP (Technical Communications) 2015 - 2014
- [c75]Michael J. Maher:
Comparing Defeasible Logics. ECAI 2014: 585-590 - [c74]Michael J. Maher:
Defeasible and Ampliative Reasoning: Same-same but Different. DARe@ECAI 2014 - [c73]Guido Governatori
Strategic Argumentation Under Grounded Semantics is NP-Complete. EUMAS 2014: 379-387 - [c72]Mohiuddin Ahmed
An Efficient Approach for Complex Data Summarization Using Multiview Clustering. Infoscale 2014: 38-47 - [c71]Mohiuddin Ahmed
A Novel Approach for Network Traffic Summarization. Infoscale 2014: 51-60 - [c70]Mohiuddin Ahmed
Heart Disease Diagnosis Using Co-clustering. Infoscale 2014: 61-70 - [c69]Michael J. Maher:
Complexity of Exploiting Privacy Violations in Strategic Argumentation. PRICAI 2014: 523-535 - 2013
- [j30]Michael J. Maher:
Relative expressiveness of defeasible logics II. Theory Pract. Log. Program. 13(4-5): 579-592 (2013) - [c68]Michael J. Maher:
Relative Expressiveness of Well-Founded Defeasible Logics. Australasian Conference on Artificial Intelligence 2013: 338-349 - 2012
- [j29]Michael J. Maher:
Relative expressiveness of defeasible logics. Theory Pract. Log. Program. 12(4-5): 793-810 (2012) - [i6]Michael J. Maher:
Relative Expressiveness of Defeasible Logics. CoRR abs/1210.1785 (2012) - 2011
- [c67]Muhammad Abdul Hakim Newton
Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation. CP 2011: 645-659 - [c66]Olivier Mehani
User- and application-centric multihomed flow management. LCN 2011: 26-34 - 2010
- [j28]David Billington, Grigoris Antoniou
An inclusion theorem for defeasible logics. ACM Trans. Comput. Log. 12(1): 6:1-6:27 (2010) - [c65]Michael J. Maher:
Contractibility and Contractible Approximations of Soft Global Constraints. ICLP (Technical Communications) 2010: 114-123 - [c64]Michael J. Maher:
Human and Unhuman Commonsense Reasoning. LPAR (Yogyakarta) 2010: 16-29
2000 – 2009
- 2009
- [j27]Michael J. Maher:
Local consistency for extended CSPs. Theor. Comput. Sci. 410(46): 4769-4783 (2009) - [c63]Michael J. Maher:
SOGgy Constraints: Soft Open Global Constraints. CP 2009: 584-591 - [c62]Michael J. Maher:
Open Constraints in a Boundable World. CPAIOR 2009: 163-177 - [c61]Michael J. Maher:
Open Contractible Global Constraints. IJCAI 2009: 578-583 - [i5]Michael J. Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh:
Flow-Based Propagators for the SEQUENCE and Related Global Constraints. CoRR abs/0909.4452 (2009) - 2008
- [c60]Michael J. Maher, Nina Narodytska, Claude-Guy Quimper
Flow-Based Propagators for the SEQUENCE and Related Global Constraints. CP 2008: 159-174 - [c59]Michael J. Maher, Ge Huang:
On Computing Constraint Abduction Answers. LPAR 2008: 421-435 - 2007
- [j26]Moreno Falaschi
Introduction Special Issue on Multiparadigm Languages and Constraint Programming. Theory Pract. Log. Program. 7(1-2): 1-2 (2007) - 2006
- [j25]Grigoris Antoniou
Embedding defeasible logic into logic programming. Theory Pract. Log. Program. 6(6): 703-735 (2006) - [c58]Michael J. Maher:
Heyting Domains for Constraint Abduction. Australian Conference on Artificial Intelligence 2006: 9-18 - [e5]Annalisa Bossi, Michael J. Maher:
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 10-12, 2006, Venice, Italy. ACM 2006, ISBN 1-59593-388-3 [contents] - 2005
- [j24]Junhu Wang
Rewriting Union Queries Using Views. Constraints An Int. J. 10(3): 219-251 (2005) - [c57]Peter J. Stuckey
The G12 Project: Mapping Solver Independent Models to Efficient Solutions. CP 2005: 13-16 - [c56]Peter J. Stuckey
The G12 Project: Mapping Solver Independent Models to Efficient Solutions. ICLP 2005: 9-13 - [c55]Michael J. Maher:
Abduction of Linear Arithmetic Constraints. ICLP 2005: 174-188 - [c54]Michael J. Maher:
Herbrand Constraint Abduction. LICS 2005: 397-406 - [i4]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher:
Embedding Defeasible Logic into Logic Programming. CoRR abs/cs/0511055 (2005) - 2004
- [j23]John Thornton, Matthew Beaumont, Abdul Sattar, Michael J. Maher:
A Local Search Approach to Modelling and Solving Interval Algebra Problems. J. Log. Comput. 14(1): 93-112 (2004) - [j22]Guido Governatori
Argumentation Semantics for Defeasible Logic. J. Log. Comput. 14(5): 675-702 (2004) - [c53]Matthew Beaumont, John Thornton, Abdul Sattar, Michael J. Maher:
Solving Over-Constrained Temporal Reasoning Problems Using Local Search. PRICAI 2004: 134-143 - [e4]Michael J. Maher:
Advances in Computer Science - ASIAN 2004, Higher-Level Decision Making, 9th Asian Computing Science Conference, Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004, Proceedings. Lecture Notes in Computer Science 3321, Springer 2004, ISBN 3-540-24087-X [contents] - [i3]Michael J. Maher:
Propositional Defeasible Logic has Linear Complexity. CoRR cs.AI/0405090 (2004) - 2003
- [c52]Michael J. Maher:
A Synthesis of Constraint Satisfaction and Constraint Solving. CP 2003: 525-539 - 2002
- [j21]Joxan Jaffar, Michael J. Maher:
Guest Editorial. Constraints An Int. J. 7(3-4): 227-228 (2002) - [c51]Junhu Wang, Michael J. Maher, Rodney W. Topor:
Rewriting General Conjunctive Queries Using Views. Australasian Database Conference 2002 - [c50]Junhu Wang, Michael J. Maher, Rodney W. Topor:
Rewriting Unions of General Conjunctive Queries Using Views. EDBT 2002: 52-69 - [c49]Michael J. Maher:
Propagation Completeness of Reactive Constraints. ICLP 2002: 148-162 - [c48]Grigoris Antoniou, Michael J. Maher:
Embedding Defeasible Logic into Logic Programs. ICLP 2002: 393-404 - [c47]Michael J. Maher:
A Model-Theoretic Semantics for Defeasible Logic. Paraconsistent Computational Logic 2002: 67-80 - [c46]John Thornton, Matthew Beaumont, Abdul Sattar, Michael J. Maher:
Applying Local Search to Temporal Reasoning. TIME 2002: 94-99 - 2001
- [j20]Michael J. Maher, Andrew Rock, Grigoris Antoniou, David Billington, Tristan Miller
Efficient Defeasible Reasoning Systems. Int. J. Artif. Intell. Tools 10(4): 483-501 (2001) - [j19]Grigoris Antoniou, David Billington, Guido Governatori
Representation results for defeasible logic. ACM Trans. Comput. Log. 2(2): 255-287 (2001) - [j18]Michael J. Maher:
Propositional Defeasible Logic has Linear Complexity. Theory Pract. Log. Program. 1(6): 691-711 (2001) - [c45]Matthew Beaumont, Abdul Sattar, Michael J. Maher, John Thornton:
Solving Overconstrained Temporal Reasoning Problems. Australian Joint Conference on Artificial Intelligence 2001: 37-49 - [c44]Junhu Wang, Rodney W. Topor, Michael J. Maher:
Reasoning with Disjunctive Constrained Tuple-Generating Dependencies. DEXA 2001: 963-973 - 2000
- [j17]Grigoris Antoniou
Defeasible Logic versus Logic Programming without Negation as Failure. J. Log. Program. 42(1): 47-57 (2000) - [c43]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher:
A Flexible Framework for Defeasible Logics. AAAI/IAAI 2000: 405-410 - [c42]Michael J. Maher:
A Denotational Semantics of Defeasible Logic. Computational Logic 2000: 209-222 - [c41]Michael J. Maher, Junhu Wang:
Optimizing Queries in Extended Relational Databases. DEXA 2000: 386-396 - [c40]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher, Andrew Rock:
A Family of Defeasible Reasoning Logics and its Implementation. ECAI 2000: 459-463 - [c39]Guido Governatori, Michael J. Maher:
An Argumentation-Theoretic Characterization of Defeasible Logic. ECAI 2000: 469-473 - [c38]Michael J. Maher, Andrew Rock, Grigoris Antoniou
Efficient defeasible reasoning systems. ICTAI 2000: 384-392 - [c37]Guido Governatori
Argumentation Semantics for Defeasible Logics. PRICAI 2000: 27-37 - [i2]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher:
A flexible framework for defeasible logics. CoRR cs.AI/0003013 (2000) - [i1]Grigoris Antoniou, David Billington, Guido Governatori, Michael J. Maher:
Representation results for defeasible logic. CoRR cs.LO/0003082 (2000)
1990 – 1999
- 1999
- [j16]Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher:
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. J. Autom. Reason. 23(1): 83-104 (1999) - [c36]Michael J. Maher, Guido Governatori:
A Semantic Decomposition of Defeasible Logics. AAAI/IAAI 1999: 299-305 - [c35]Grigoris Antoniou, David Billington, Michael J. Maher:
On the Analysis of Regulations using Defeasible Rules. HICSS 1999 - [c34]Joxan Jaffar, Michael J. Maher, Gustaf Neumann:
An Architecture and Prototype Implementation of a System for Individualized Workflows in Medical Information Systems. HICSS 1999 - [c33]Evan Tick, Roland H. C. Yap, Michael J. Maher:
Finding Fair Allocations for the Coalition Problem with Constraints. ICLP 1999: 530-544 - [c32]David Billington, Grigoris Antoniou, Guido Governatori
Revising Nonmonotonic Theories: The Case of Defeasible Logic. KI 1999: 101-112 - [c31]Grigoris Antoniou
A Comparison of Sceptical NAF-Free Logic Programming Approaches. LPNMR 1999: 347-356 - [p4]Michael J. Maher:
Adding Constraints to Logic-based Formalisms. The Logic Programming Paradigm 1999: 313-331 - 1998
- [j15]Joxan Jaffar, Michael J. Maher, Kim Marriott, Peter J. Stuckey:
The Semantics of Constraint Logic Programs. J. Log. Program. 37(1-3): 1-46 (1998) - [c30]Michael J. Maher, Grigoris Antoniou, David Billington:
A Study of Provability in Defeasible Logic. Australian Joint Conference on Artificial Intelligence 1998: 215-226 - [c29]Grigoris Antoniou, David Billington, Michael J. Maher:
Normal Forms for Defeasible Logic. IJCSLP 1998: 160-174 - [e3]Michael J. Maher, Jean-Francois Puget:
Principles and Practice of Constraint Programming - CP98, 4th International Conference, Pisa, Italy, October 26-30, 1998, Proceedings. Lecture Notes in Computer Science 1520, Springer 1998, ISBN 3-540-65224-8 [contents] - 1997
- [j14]Alexander Brodsky, Joxan Jaffar, Michael J. Maher:
Toward Practical Query Evaluation for Constraint Databases. Constraints An Int. J. 2(3/4): 279-304 (1997) - [j13]Michael J. Maher:
Constrained Dependencies. Theor. Comput. Sci. 173(1): 113-149 (1997) - 1996
- [c28]Michael J. Maher, Divesh Srivastava:
Chasing Constrained Tuple-Generating Dependencies. PODS 1996: 128-138 - [e2]Michael Jampel, Eugene C. Freuder, Michael J. Maher:
Over-Constrained Systems. Lecture Notes in Computer Science 1106, Springer 1996, ISBN 3-540-61479-6 [contents] - [e1]Michael J. Maher:
Logic Programming, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, Bonn, Germany, September 2-6, 1996. MIT Press 1996, ISBN 0-262-63173-3 [contents] - 1995
- [j12]Michael J. Maher, Peter J. Stuckey:
On Inductive Inference of Cyclic Structures. Ann. Math. Artif. Intell. 15(2): 167-208 (1995) - [j11]Roberto Barbuti, Michael Codish
Oracle Semantics for Prolog. Inf. Comput. 122(2): 178-200 (1995) - [j10]Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo
Guest Editors' Introduction: Special Section: Ten Years of Logic Programming. J. Log. Program. 23(2): 87-88 (1995) - [c27]Michael J. Maher:
Constrained Dependencies. CP 1995: 170-185 - [c26]Alexander Brodsky, Catherine Lassez, Jean-Louis Lassez, Michael J. Maher:
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. PODS 1995: 54-65 - [c25]Joxan Jaffar, Michael J. Maher, Gustaf Neumann:
Logic Programming and Object Modelling: A Case Study (Abstract). ILPS 1995: 48 - 1994
- [j9]Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher:
Guest Editor's Introduction. J. Log. Program. 19/20: 1-3 (1994) - [j8]Joxan Jaffar, Michael J. Maher:
Constraint Logic Programming: A Survey. J. Log. Program. 19/20: 503-581 (1994) - [c24]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap:
Beyond Finite Domains. PPCP 1994: 86-94 - [c23]Michael J. Maher:
Constrained Dependencies. ILPS Workshop: Constraints and Databases 1994 - 1993
- [j7]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap:
Projecting CLP (R) Constraints. New Gener. Comput. 11(3): 449-469 (1993) - [j6]Michael J. Maher:
A Tranformation System for Deductive Databases Modules with Perfect Model Semantics. Theor. Comput. Sci. 110(2): 377-403 (1993) - [c22]Michael J. Maher:
A Logic Programming View of CLP. ICLP 1993: 737-753 - [c21]Alexander Brodsky, Joxan Jaffar, Michael J. Maher:
Toward Practical Constraint Databases. VLDB 1993: 567-580 - 1992
- [j5]Jean-Louis Lassez, Michael J. Maher:
On Fourier's Algorithm for Linear Arithmetic Constraints. J. Autom. Reason. 9(3): 373-379 (1992) - [c20]Roberto Barbuti, Michael Codish
Oracle Semantics for Prolog. ALP 1992: 100-114 - [c19]Michael J. Maher:
A CLP View of Logic Programming. ALP 1992: 364-383 - [c18]Joxan Jaffar, Michael J. Maher, Peter J. Stuckey, Roland H. C. Yap:
Output in CLP. FGCS 1992: 987-995 - 1991
- [c17]Michael J. Maher:
Representing Sets of Rational Trees Using Techniques of Non-Monotonic Reasoning. LPNMR 1991: 181-195 - [c16]Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Elimination of Negation in Term Algebras. MFCS 1991: 1-16 - [c15]Haim Gaifman, Michael J. Maher, Ehud Shapiro:
Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs. PODC 1991: 241-255
1980 – 1989
- 1989
- [c14]Michael J. Maher:
A Transformation System for Deductive Database Modules with Perfect Model Semantics. FSTTCS 1989: 89-98 - [c13]Alan Borning, Michael J. Maher, Amy Martindale, Molly Wilson:
Constraint Hierarchies and Logic Programming. ICLP 1989: 149-164 - [c12]Michael J. Maher, Peter J. Stuckey:
Expanding Query Power in Constraint Logic Programming Languages. NACLP 1989: 20-36 - [c11]Haim Gaifman, Michael J. Maher, Ehud Shapiro:
Reactive Behaviour Semantics for Concurrent Constraint Logic Programs. NACLP 1989: 553-569 - [c10]Michael J. Maher, Raghu Ramakrishnan:
Déjà Vu in Fixpoints of Logic Programs. NACLP 1989: 963-980 - 1988
- [c9]Michael J. Maher:
Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. LICS 1988: 348-357 - [p3]Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Unification Revisited. Foundations of Deductive Databases and Logic Programming. 1988: 587-625 - [p2]Michael J. Maher:
Equivalences of Logic Programs. Foundations of Deductive Databases and Logic Programming. 1988: 627-658 - 1987
- [c8]Michael J. Maher:
Logic Semantics for a Class of Committed-Choice Programs. ICLP 1987: 858-876 - [c7]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
PROLOG - II as an instance of the logic programming language scheme. Formal Description of Programming Concepts 1987: 275-298 - 1986
- [j4]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Comments on "General Failure of Logic Programs". J. Log. Program. 3(2): 115-118 (1986) - [c6]Jean-Louis Lassez, Michael J. Maher, Kim Marriott:
Unification Revisited. Foundations of Logic and Functional Programming 1986: 67-113 - [c5]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. ICLP 1986: 223-241 - [c4]Michael J. Maher:
Eqivalences of Logic Programs. ICLP 1986: 410-424 - [p1]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Logic Programming Language Scheme. Logic Programming: Functions, Relations, and Equations 1986: 441-467 - 1985
- [j3]Jean-Louis Lassez, Michael J. Maher:
Optimal Fixedpoints of Logic Programs. Theor. Comput. Sci. 39: 15-25 (1985) - 1984
- [j2]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
A Theory of Complete Logic Programs with Equality. J. Log. Program. 1(3): 211-223 (1984) - [j1]Jean-Louis Lassez, Michael J. Maher:
Closures and Fairness in the Semantics of Programming Logic. Theor. Comput. Sci. 29: 167-184 (1984) - [c3]Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
A Theory of Complete Logic Programs with Equality. FGCS 1984: 175-184 - [c2]David A. Wolfram, Michael J. Maher, Jean-Louis Lassez:
A Unified Treatment of Resolution Strategies for Logic Programs. ICLP 1984: 263-276 - 1983
- [c1]Jean-Louis Lassez, Michael J. Maher:
The Denotational Semantics of Horn Clauses as a Production System. AAAI 1983: 229-231
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-07 21:24 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: