default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFahiem Bacchus
Person information
- affiliation: University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c97]Randy Hickey, Fahiem Bacchus:
Large Neighbourhood Search for Anytime MaxSAT Solving. IJCAI 2022: 1818-1824- 2021
- [c96]Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger B. Grosse, Sanjit A. Seshia, Fahiem Bacchus:
Learning Branching Heuristics for Propositional Model Counting. AAAI 2021: 12427-12435 - [c95]Jeremias Berg
, Fahiem Bacchus, Alex Poole:
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract). IJCAI 2021: 4745-4749 - [p1]Fahiem Bacchus, Matti Järvisalo, Ruben Martins:
Maximum Satisfiability. Handbook of Satisfiability 2021: 929-991 - 2020
- [c94]Nick Feng, Fahiem Bacchus:
Clause Size Reduction with all-UIP Learning. SAT 2020: 28-45 - [c93]Randy Hickey, Fahiem Bacchus:
Trail Saving on Backtrack. SAT 2020: 46-61 - [c92]Jeremias Berg, Fahiem Bacchus, Alex Poole:
Abstract Cores in Implicit Hitting Set MaxSat Solving. SAT 2020: 277-294 - [i18]Pashootan Vaezipoor, Gil Lederman, Yuhuai Wu, Chris J. Maddison, Roger B. Grosse, Edward A. Lee, Sanjit A. Seshia, Fahiem Bacchus:
Learning Branching Heuristics for Propositional Model Counting. CoRR abs/2007.03204 (2020)
2010 – 2019
- 2019
- [j16]Fahiem Bacchus, Matti Järvisalo, Ruben Martins:
MaxSAT Evaluation 2018: New Developments and Detailed Results. J. Satisf. Boolean Model. Comput. 11(1): 99-131 (2019) - [c91]Randy Hickey, Fahiem Bacchus:
Speeding Up Assumption-Based SAT. SAT 2019: 164-182 - 2018
- [c90]Katalin Fazekas, Fahiem Bacchus, Armin Biere:
Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. IJCAR 2018: 134-151 - [c89]Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, Paul Saikko:
Reduced Cost Fixing for Maximum Satisfiability. IJCAI 2018: 5209-5213 - 2017
- [c88]Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, Paul Saikko:
Reduced Cost Fixing in MaxSAT. CP 2017: 641-651 - 2016
- [c87]Andrew Perrault, Joanna Drummond, Fahiem Bacchus:
Strategy-Proofness in the Stable Matching Problem with Couples. AAMAS 2016: 132-140 - [c86]Fahiem Bacchus, George Katsirelos:
Finding a Collection of MUSes Incrementally. CPAIOR 2016: 35-44 - 2015
- [c85]Fahiem Bacchus, George Katsirelos:
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets. CAV (2) 2015: 70-86 - [c84]Joanna Drummond, Andrew Perrault, Fahiem Bacchus:
SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples. IJCAI 2015: 518-525 - [c83]Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl:
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR 2015: 418-433 - [i17]Andrew Perrault, Joanna Drummond, Fahiem Bacchus:
Exploring Strategy-Proofness, Uniqueness, and Pareto Optimality for the Stable Matching Problem with Couples. CoRR abs/1505.03463 (2015) - 2014
- [c82]Fahiem Bacchus, Jessica Davies, Maria Tsimpoukelli, George Katsirelos:
Relaxation Search: A Simple Way of Managing Optional Clauses. AAAI 2014: 835-841 - [c81]Nina Narodytska, Fahiem Bacchus:
Maximum Satisfiability Using Core-Guided MaxSAT Resolution. AAAI 2014: 2717-2723 - [c80]Nina Narodytska, Alexander Legg, Fahiem Bacchus, Leonid Ryzhyk, Adam Walker:
Solving Games without Controllable Predecessor. CAV 2014: 533-540 - [c79]Fahiem Bacchus, Nina Narodytska:
Cores in Core Based MaxSat Algorithms: An Analysis. SAT 2014: 7-15 - [i16]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Solving #SAT and Bayesian Inference with Backtracking Search. CoRR abs/1401.3458 (2014) - 2013
- [c78]Jessica Davies, Fahiem Bacchus:
Postponing Optimization to Speed Up MAXSAT Solving. CP 2013: 247-262 - [c77]Erin Delisle, Fahiem Bacchus:
Solving Weighted CSPs by Successive Relaxations. CP 2013: 273-281 - [c76]Alexandra Goultiaeva, Fahiem Bacchus:
Recovering and Utilizing Partial Duality in QBF. SAT 2013: 83-99 - [c75]Jessica Davies, Fahiem Bacchus:
Exploiting the Power of mip Solvers in maxsat. SAT 2013: 166-181 - [i15]Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman:
UCP-Networks: A Directed Graphical Representation of Conditional Utilities. CoRR abs/1301.2259 (2013) - [i14]Fahiem Bacchus, Adam J. Grove:
Graphical Models for Preference and Utility. CoRR abs/1302.4928 (2013) - [i13]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
Generating New Beliefs From Old. CoRR abs/1302.6783 (2013) - [i12]Wai Lam, Fahiem Bacchus:
Using New Data to Refine a Bayesian Network. CoRR abs/1302.6826 (2013) - [i11]Fahiem Bacchus:
Using First-Order Probability Logic for the Construction of Bayesian Networks. CoRR abs/1303.1480 (2013) - [i10]Wai Lam, Fahiem Bacchus:
Using Causal Information and Local Measures to Learn Bayesian Networks. CoRR abs/1303.1483 (2013) - [i9]Fahiem Bacchus:
Lp : A Logic for Statistical Information. CoRR abs/1304.1491 (2013) - [i8]Fahiem Bacchus:
Probability Distributions Over Possible Worlds. CoRR abs/1304.2341 (2013) - 2012
- [c74]Lei Zhang, Fahiem Bacchus:
MAXSAT Heuristics for Cost Optimal Planning. AAAI 2012: 1846-1852 - [c73]Alexandra Goultiaeva, Fahiem Bacchus:
Off the Trail: Re-examining the CDCL Algorithm. SAT 2012: 30-43 - [i7]Fahiem Bacchus, Tommi S. Jaakkola:
Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (2005). CoRR abs/1208.5159 (2012) - [i6]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Value Elimination: Bayesian Inference via Backtracking Search. CoRR abs/1212.2452 (2012) - 2011
- [c72]Jessica Davies, Fahiem Bacchus:
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances. CP 2011: 225-239 - [c71]Alexandra Goultiaeva, Allen Van Gelder, Fahiem Bacchus:
A Uniform Approach for Generating Proofs and Strategies for Both True and False QBF Formulas. IJCAI 2011: 546-553 - [e2]Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert:
Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI 2011 [contents] - [i5]David Poole, Fahiem Bacchus, Jacek Kisynski:
Towards Completely Lifted Search-based Probabilistic Inference. CoRR abs/1107.4035 (2011) - [i4]Fahiem Bacchus:
The Power of Modeling - a Response to PDDL2.1. CoRR abs/1110.2729 (2011) - 2010
- [c70]Alexandra Goultiaeva, Fahiem Bacchus:
Exploiting QBF Duality on a Circuit Representation. AAAI 2010: 71-76 - [c69]Jessica Davies, Jeremy Cho, Fahiem Bacchus:
Using Learnt Clauses in maxsat. CP 2010: 176-190 - [c68]Hratch Mangassarian, Bao Le, Alexandra Goultiaeva, Andreas G. Veneris, Fahiem Bacchus:
Leveraging dominators for preprocessing QBF. DATE 2010: 1695-1700 - [c67]Alexandra Goultiaeva, Fahiem Bacchus:
Exploiting Circuit Representations in QBF Solving. SAT 2010: 333-339
2000 – 2009
- 2009
- [j15]Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith:
A heuristic search approach to planning with temporally extended preferences. Artif. Intell. 173(5-6): 593-618 (2009) - [j14]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Solving #SAT and Bayesian Inference with Backtracking Search. J. Artif. Intell. Res. 34: 391-442 (2009) - [c66]Matthew Kitching, Fahiem Bacchus:
Exploiting Decomposition on Constraint Problems with High Tree-Width. IJCAI 2009: 525-531 - [c65]Matthew Kitching, Fahiem Bacchus:
Set Branching in Constraint Optimization. IJCAI 2009: 532-537 - [c64]Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus:
Beyond CNF: A Circuit-Based QBF Solver. SAT 2009: 412-426 - 2008
- [c63]Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, Allen Van Gelder:
Clause Learning Can Effectively P-Simulate General Propositional Resolution. AAAI 2008: 283-290 - [c62]Matthew Kitching, Fahiem Bacchus:
Exploiting Decomposition in Constraint Optimization Problems. CP 2008: 478-492 - 2007
- [c61]Jessica Davies, Fahiem Bacchus:
Using More Reasoning to Improve #SAT Solving. AAAI 2007: 185-190 - [c60]Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, Sheila A. McIlraith:
Using Expectation Maximization to Find Likely Assignments for Solving CSP's. AAAI 2007: 224-230 - [c59]Fahiem Bacchus:
Caching in Backtracking Search. CP 2007: 1 - [c58]Fahiem Bacchus:
GAC Via Unit Propagation. CP 2007: 133-147 - [c57]Fahiem Bacchus, Kostas Stergiou:
Solution Directed Backjumping for QCSP. CP 2007: 148-163 - [c56]Matthew Kitching, Fahiem Bacchus:
Symmetric Component Caching. IJCAI 2007: 118-124 - [c55]Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith:
A Heuristic Search Approach to Planning with Temporally Extended Preferences. IJCAI 2007: 1808-1815 - [c54]Horst Samulowitz, Fahiem Bacchus:
Dynamically Partitioning for Solving QBF. SAT 2007: 215-229 - 2006
- [c53]Horst Samulowitz, Jessica Davies, Fahiem Bacchus:
Preprocessing QBF. CP 2006: 514-529 - [c52]Fahiem Bacchus:
CSPs: Adding Structure to SAT. SAT 2006: 10-10 - [c51]Horst Samulowitz, Fahiem Bacchus:
Binary Clause Reasoning in QBF. SAT 2006: 353-367 - 2005
- [c50]George Katsirelos, Fahiem Bacchus:
Generalized NoGoods in CSPs. AAAI 2005: 390-396 - [c49]Horst Samulowitz, Fahiem Bacchus:
Using SAT in QBF. CP 2005: 578-592 - [c48]Fahiem Bacchus, Toby Walsh:
Propagating Logical Combinations of Constraints. IJCAI 2005: 35-40 - [e1]Fahiem Bacchus, Toby Walsh:
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings. Lecture Notes in Computer Science 3569, Springer 2005, ISBN 3-540-26276-8 [contents] - 2004
- [c47]Ronald P. A. Petrick, Fahiem Bacchus:
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. ICAPS 2004: 2-11 - [c46]Christian Thiffault, Fahiem Bacchus, Toby Walsh:
Solving Non-clausal Formulas with DPLL Search. CP 2004: 663-678 - [c45]Nathanael Hyafil, Fahiem Bacchus:
Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning. ECAI 2004: 1033-1034 - [c44]Ronald P. A. Petrick, Fahiem Bacchus:
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. KR 2004: 613-622 - [c43]Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi:
Combining Component Caching and Clause Learning for Effective Model Counting. SAT 2004 - [c42]Christian Thiffault, Fahiem Bacchus, Toby Walsh:
Solving Non-clausal Formulas with DPLL search. SAT 2004 - 2003
- [j13]Fahiem Bacchus:
The Power of Modeling - a Response to PDDL2.1. J. Artif. Intell. Res. 20: 125-132 (2003) - [c41]Nathanael Hyafil, Fahiem Bacchus:
Conformant Probabilistic Planning via CSPs. ICAPS 2003: 205-214 - [c40]George Katsirelos, Fahiem Bacchus:
Unrestricted Nogood Recording in CSP Search. CP 2003: 873-877 - [c39]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Algorithms and Complexity Results for #SAT and Bayesian Inference. FOCS 2003: 340-351 - [c38]Adriana Lopez, Fahiem Bacchus:
Generalizing GraphPlan by Formulating Planning as a CSP. IJCAI 2003: 954-960 - [c37]Fahiem Bacchus, Jonathan Winter:
Effective Preprocessing with Hyper-Resolution and Equality Reduction. SAT 2003: 341-355 - [c36]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
Value Elimination: Bayesian Interence via Backtracking Search. UAI 2003: 20-28 - [i3]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
From Statistical Knowledge Bases to Degrees of Belief. CoRR cs.AI/0307056 (2003) - [i2]Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi:
DPLL with Caching: A new algorithm for #SAT and Bayesian Inference. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j12]Fahiem Bacchus, Xinguang Chen, Peter van Beek, Toby Walsh:
Binary vs. non-binary constraints. Artif. Intell. 140(1/2): 1-37 (2002) - [c35]Fahiem Bacchus:
Enhancing Davis Putnam with Extended Binary Clause Reasoning. AAAI/IAAI 2002: 613-619 - [c34]Ronald P. A. Petrick, Fahiem Bacchus:
A Knowledge-Based Approach to Planning with Incomplete Information and Sensing. AIPS 2002: 212-222 - 2001
- [j11]Fahiem Bacchus:
The AIPS '00 Planning Competition. AI Mag. 22(3): 47-56 (2001) - [c33]George Katsirelos, Fahiem Bacchus:
GAC on Conjunctions of Constraints. CP 2001: 610-614 - [c32]Fahiem Bacchus, Michael Ady:
Planning with Resources and Concurrency: A Forward Chaining Approach. IJCAI 2001: 417-424 - [c31]Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman:
UCP-Networks: A Directed Graphical Representation of Conditional Utilities. UAI 2001: 56-64 - 2000
- [j10]Fahiem Bacchus, Froduald Kabanza:
Using temporal logics to express search control knowledge for planning. Artif. Intell. 116(1-2): 123-191 (2000) - [c30]Fahiem Bacchus:
Extending Forward Checking. CP 2000: 35-51
1990 – 1999
- 1999
- [j9]Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque:
Reasoning about Noisy Sensors and Effectors in the Situation Calculus. Artif. Intell. 111(1-2): 171-208 (1999) - 1998
- [j8]Fahiem Bacchus, Froduald Kabanza:
Planning for Temporally Extended Goals. Ann. Math. Artif. Intell. 22(1-2): 5-27 (1998) - [c29]Fahiem Bacchus, Peter van Beek:
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. AAAI/IAAI 1998: 310-318 - [c28]Fahiem Bacchus, Yee Whye Teh:
Making Forward Chaining Relevant. AIPS 1998: 54-61 - [c27]Fahiem Bacchus, Ronald P. A. Petrick:
Modeling an Agent's Incomplete Knowledge During Planning and During Execution. KR 1998: 432-443 - [i1]Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque:
Reasoning about Noisy Sensors and Effectors in the Situation Calculus. CoRR cs.AI/9809013 (1998) - 1997
- [c26]Fahiem Bacchus, Craig Boutilier, Adam J. Grove:
Structured Solution Methods for Non-Markovian Decision Processes. AAAI/IAAI 1997: 112-117 - 1996
- [j7]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
From Statistical Knowledge Bases to Degrees of Belief. Artif. Intell. 87(1-2): 75-143 (1996) - [c25]Fahiem Bacchus, Craig Boutilier, Adam J. Grove:
Rewarding Behaviors. AAAI/IAAI, Vol. 2 1996: 1160-1167 - [c24]Fahiem Bacchus, Froduald Kabanza:
Planning for Temporally Extended Goals. AAAI/IAAI, Vol. 2 1996: 1215-1222 - [c23]Fahiem Bacchus, Adam J. Grove:
Utility Independence in a Qualitative Decision Theory. KR 1996: 542-552 - [c22]Fahiem Bacchus:
Using Temporal Logics for Planning and Control. TIME 1996: 2-3 - 1995
- [c21]Fahiem Bacchus, Paul van Run:
Dynamic Variable Ordering in CSPs. CP 1995: 258-275 - [c20]Fahiem Bacchus, Adam J. Grove:
On the Forward Checking Algorithm. CP 1995: 292-308 - [c19]Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque:
Reasoning about Noisy Sensors in the Situation Calculus. IJCAI 1995: 1933-1940 - [c18]Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque:
Reasoning about Noisy Sensors (and Effectors) in the Situation Calculus. Reasoning with Uncertainty in Robotics 1995: 218-220 - [c17]Fahiem Bacchus, Adam J. Grove:
Graphical models for preference and utility. UAI 1995: 3-10 - 1994
- [j6]Fahiem Bacchus, Qiang Yang:
Downward Refinement and the Efficiency of Hierarchical Problem Solving. Artif. Intell. 71(1): 43-100 (1994) - [j5]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
A Response to "Believing on the Basis of the Evidence". Comput. Intell. 10: 21-25 (1994) - [j4]Wai Lam, Fahiem Bacchus:
Learning Bayesian Belief Networks: An Approach Based on the MDL Principle. Comput. Intell. 10: 269-294 (1994) - [c16]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
Forming Beliefs about a Changing World. AAAI 1994: 222-229 - [c15]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
Generating New Beliefs from Old. UAI 1994: 37-45 - [c14]Wai Lam, Fahiem Bacchus:
Using New Data to Refine a Bayesian Network. UAI 1994: 383-390 - 1993
- [c13]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
Generating Degrees of Belief from Statistical Information: An Overview. FSTTCS 1993: 318-325 - [c12]Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, Daphne Koller:
Statistical Foundations for Default Reasoning. IJCAI 1993: 563-569 - [c11]Fahiem Bacchus:
Using First-Order Probability Logic for the Construction of Bayesian Networks. UAI 1993: 219-226 - [c10]Wai Lam, Fahiem Bacchus:
Using Causal Information and Local Measures to Learn Bayesian Networks. UAI 1993: 243-250 - 1992
- [c9]Fahiem Bacchus, Qiang Yang:
The Expected Value of Hierarchical Problem-Solving. AAAI 1992: 369-374 - [c8]Fahiem Bacchus, Adam J. Grove, Daphne Koller, Joseph Y. Halpern:
From Statistics to Beliefs. AAAI 1992: 602-608 - 1991
- [j3]Fahiem Bacchus, Josh Tenenberg, Johannes A. G. M. Koomen:
A Non-Reified Temporal Logic. Artif. Intell. 52(1): 87-108 (1991) - [c7]Fahiem Bacchus:
Default Reasoning From Statistics. AAAI 1991: 392-398 - [c6]Fahiem Bacchus, Qiang Yang:
The Downward Refinement Property. IJCAI 1991: 286-293 - 1990
- [b1]Fahiem Bacchus:
Representing and reasoning with probabilistic knowledge - a logical approach to probabilities. MIT Press 1990, ISBN 978-0-262-02317-7, pp. 1-233 - [j2]Fahiem Bacchus:
Probability and logic: a reply to Cheeseman. Comput. Intell. 6: 180-183 (1990) - [j1]Fahiem Bacchus:
Lp, a logic for representing and reasoning with statistical knowledge. Comput. Intell. 6: 209-231 (1990) - [c5]Fahiem Bacchus:
Probabilistic Belief Logics. ECAI 1990: 59-64
1980 – 1989
- 1989
- [c4]Fahiem Bacchus:
A Modest, but Semantically Well Founded, Inheritance Reasoner. IJCAI 1989: 1104-1109 - [c3]Fahiem Bacchus, Josh Tenenberg, Johannes A. G. M. Koomen:
A Non-Reified Temporal Logic. KR 1989: 2-10 - [c2]Fahiem Bacchus:
Lp: A Logic for Statistical Information. UAI 1989: 3-14 - 1988
- [c1]Fahiem Bacchus:
On probability distributions over possible worlds. UAI 1988: 217-226
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-06-18 21:16 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:
