default search action
Felip Manyà
Person information
- affiliation: Artificial Intelligence Research Institute, Bellaterra, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j38]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
Integrating multi-armed bandit with local search for MaxSAT. Artif. Intell. 338: 104242 (2025) - 2024
- [c89]Jordi Coll, Chu Min Li, Felip Manyà, Elifnaz Yangin:
A Complete Tableau Calculus for Non-Clausal Regular MinSAT. CCIA 2024: 278-287 - [c88]Jordi Coll, Chu Min Li, Felip Manyà, Elifnaz Yangin:
A Tableau Calculus for Non-Clausal Regular MaxSAT. ISMVL 2024: 137-142 - 2023
- [j37]Jordi Coll, Chu-Min Li, Felip Manyà
, Elifnaz Yangin:
MaxSAT resolution for regular propositional logic. Int. J. Approx. Reason. 162: 109010 (2023) - [j36]Hua Jiang, Ke Bai, Hai-Jiao Liu, Chu-Min Li, Felip Manyà, Zhang-Hua Fu:
Parallel Bounded Search for the Maximum Clique Problem. J. Comput. Sci. Technol. 38(5): 1187-1202 (2023) - [c87]Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin:
A Complete Tableau Calculus for the Regular MaxSAT Problem. CCIA 2023: 359-368 - [c86]Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Manyà:
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. IJCAI 2023: 1979-1987 - [c85]Sandro Preto
Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks. ISMVL 2023: 158-163 - [c84]Sandro Preto
Linking Łukasiewicz Logic and Boolean Maximum Satisfiability. ISMVL 2023: 164-169 - [c83]Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, Felip Manyà:
A Tableau Calculus for Signed Maximum Satisfiability. ISMVL 2023: 170-175 - [c82]Zuzana Haniková
The MaxSAT Problem in the Real-Valued MV-Algebra. TABLEAUX 2023: 386-404 - 2022
- [j35]Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He:
Boosting branch-and-bound MaxSAT solvers with clause learning. AI Commun. 35(2): 131-151 (2022) - [j34]Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres
Incomplete MaxSAT approaches for combinatorial testing. J. Heuristics 28(4): 377-431 (2022) - [j33]Teddy Nurcahyadi
Negative Learning Ant Colony Optimization for MaxSAT. Int. J. Comput. Intell. Syst. 15(1): 71 (2022) - [j32]Chu Min Li, Felip Manyà
Clausal Forms in MaxSAT and MinSAT. Int. J. Comput. Intell. Syst. 15(1): 97 (2022) - [c81]Chu Min Li, Felip Manyà:
Inference in MaxSAT and MinSAT. The Logic of Software. A Tasting Menu of Formal Methods 2022: 350-369 - [c80]Shoulin Li, Jordi Coll, Djamal Habet, Chu-Min Li, Felip Manyà:
A Tableau Calculus for MaxSAT Based on Resolution. CCIA 2022: 35-44 - [c79]Jiongzhi Zheng
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. IJCAI 2022: 1901-1907 - [c78]Chu-Min Li, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet, Kun He:
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract). IJCAI 2022: 5299-5303 - [i5]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu Min Li, Felip Manyà:
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit. CoRR abs/2201.05544 (2022) - [i4]Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, Chu-Min Li, Felip Manyà:
Incorporating Multi-armed Bandit with Local Search for MaxSAT. CoRR abs/2211.16011 (2022) - 2021
- [j31]Christian Blum
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125: 105089 (2021) - [j30]Josep Argelich
Clause tableaux for maximum and minimum satisfiability. Log. J. IGPL 29(1): 7-27 (2021) - [j29]Chu-Min Li, Fan Xiao, Felip Manyà:
A resolution calculus for MinSAT. Log. J. IGPL 29(1): 28-44 (2021) - [c77]Chu-Min Li, Felip Manyà, Joan Ramon Soler
From Non-Clausal to Clausal MinSAT. CCIA 2021: 27-36 - [c76]Chu-Min Li, Zhenxing Xu, Jordi Coll
Combining Clause Learning and Branch and Bound for MaxSAT. CP 2021: 38:1-38:18 - [p2]Chu Min Li, Felip Manyà:
MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2021: 903-927 - [e2]Chu-Min Li
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Lecture Notes in Computer Science 12831, Springer 2021, ISBN 978-3-030-80222-6 [contents] - [i3]Carlos Ansótegui, Felip Manyà, Jesus Ojeda
Incomplete MaxSAT Approaches for Combinatorial Testing. CoRR abs/2105.12552 (2021) - 2020
- [j28]Chu-Min Li
Clause vivification by unit propagation in CDCL SAT solvers. Artif. Intell. 279 (2020) - [j27]Felip Manyà, Santiago Negrete, Carme Roig, Joan Ramon Soler
Solving the Team Composition Problem in a Classroom. Fundam. Informaticae 174(1): 83-101 (2020) - [c75]Chu Min Li, Felip Manyà, Amanda Vidal:
Tableaux for Maximum Satisfiability in Łukasiewicz Logic. ISMVL 2020: 243-248
2010 – 2019
- 2019
- [j26]Fan Xiao, Chu-Min Li, Mao Luo, Felip Manyà
A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. 62(7): 72103:1-72103:13 (2019) - [j25]Miquel Bofill
New complexity results for Łukasiewicz logic. Soft Comput. 23(7): 2187-2197 (2019) - [c74]Chu Min Li, Felip Manyà
Clausal Form Transformation in MaxSAT. ISMVL 2019: 132-137 - [c73]Chu Min Li, Felip Manyà
A Tableau Calculus for Non-clausal Maximum Satisfiability. TABLEAUX 2019: 58-73 - 2018
- [j24]Chu-Min Li
A new upper bound for the maximum weight clique problem. Eur. J. Oper. Res. 270(1): 66-77 (2018) - [c72]Hua Jiang, Chu-Min Li, Yanli Liu
A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. AAAI 2018: 1338-1346 - [c71]Josep Argelich
Clause Branching in MaxSAT and MinSAT. CCIA 2018: 17-26 - [i2]Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li:
Clause Vivification by Unit Propagation in CDCL SAT Solvers. CoRR abs/1807.11061 (2018) - 2017
- [j23]Chu-Min Li, Hua Jiang, Felip Manyà
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84: 1-15 (2017) - [c70]Hua Jiang, Chu-Min Li, Felip Manyà:
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. AAAI 2017: 830-838 - [c69]Felip Manyà
A MaxSAT-Based Approach to the Team Composition Problem in a Classroom. AAMAS Workshops (Visionary Papers) 2017: 164-173 - [c68]Joan Casas-Roma
Solving MaxSAT with Natural Deduction. CCIA 2017: 186-195 - [c67]Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü:
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. IJCAI 2017: 703-711 - [c66]Josep Argelich
Exploiting Many-Valued Variables in MaxSAT. ISMVL 2017: 155-160 - 2016
- [j22]Carlos Ansótegui
Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers. Fuzzy Sets Syst. 292: 32-48 (2016) - [c65]Chu Min Li, Felip Manyà
A Clause Tableau Calculus for MinSAT. CCIA 2016: 88-97 - [c64]Hua Jiang, Chu Min Li, Felip Manyà
Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs. ECAI 2016: 939-947 - [c63]Chu Min Li, Felip Manyà, Joan Ramon Soler:
A Clause Tableau Calculus for MaxSAT. IJCAI 2016: 766-772 - [c62]Joan Ramon Soler
A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics. ISMVL 2016: 270-275 - 2015
- [j21]Cèsar Fernández, Felip Manyà
Approximate dynamic programming for automated vacuum waste collection systems. Environ. Model. Softw. 67: 128-137 (2015) - [j20]Carlos Ansótegui, Miquel Bofill, Felip Manyà, Mateu Villaret:
SAT and SMT Technology for Many-Valued Logics. J. Multiple Valued Log. Soft Comput. 24(1-4): 151-172 (2015) - [c61]Chu Min Li, Felip Manyà:
An Exact Inference Scheme for MinSAT. IJCAI 2015: 1959-1965 - [c60]Miquel Bofill
Finding Hard Instances of Satisfiability in Lukasiewicz Logics. ISMVL 2015: 30-35 - [c59]Miquel Bofill
The Complexity of 3-Valued Łukasiewicz Rules. MDAI 2015: 221-229 - 2014
- [j19]Cèsar Fernández, Felip Manyà
Modeling energy consumption in automated vacuum waste collection systems. Environ. Model. Softw. 56: 63-73 (2014) - [c58]Josep Argelich
Many-Valued MinSAT Solving. ISMVL 2014: 32-37 - 2013
- [j18]Carlos Ansótegui
Resolution procedures for multiple-valued optimization. Inf. Sci. 227: 43-59 (2013) - [c57]Carlos Ansótegui
A Max-SAT-Based Approach to Constructing Optimal Covering Arrays. CCIA 2013: 51-59 - [c56]Josep Argelich
MinSAT versus MaxSAT for Optimization Problems. CP 2013: 133-142 - 2012
- [j17]Chu Min Li, Zhu Zhu, Felip Manyà
Optimizing with minimum satisfiability. Artif. Intell. 190: 32-44 (2012) - [j16]Francesc Esteva, Joan Gispert, Felip Manyà:
Introduction to the Special Issue of the IEEE 40th International Symposium on Multiple-Valued Logic. J. Multiple Valued Log. Soft Comput. 19(1-3): 1-2 (2012) - [j15]Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà:
Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT. J. Multiple Valued Log. Soft Comput. 19(1-3): 3-23 (2012) - [j14]Francesc Esteva, Joan Gispert, Felip Manyà:
Foreward. J. Multiple Valued Log. Soft Comput. 19(4): 283 (2012) - [c55]Ramón Béjar, Cèsar Fernández, Carles Mateu, Felip Manyà, Francina Sole-Mauri, David Vidal:
The Automated Vacuum Waste Collection Optimization Problem. AAAI 2012: 264-266 - [c54]Carlos Ansótegui
A SAT-Based Approach to MinSAT. CCIA 2012: 185-189 - [c53]Zhu Zhu, Chu Min Li, Felip Manyà
A New Encoding from MinSAT into MaxSAT. CP 2012: 455-463 - [c52]Ramón Béjar
Optimizing Energy Consumption in Automated Vacuum Waste Collection Systems. ICTAI 2012: 291-298 - [c51]Carlos Ansótegui
Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. ISMVL 2012: 25-30 - 2011
- [c50]Josep Argelich
Experimenting with the Instances of the MaxSAT Evaluation. CCIA 2011: 31-40 - [c49]Chu Min Li, Zhu Zhu, Felip Manyà
Minimum Satisfiability and Its Applications. IJCAI 2011: 605-610 - [c48]Carlos Ansótegui
Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic. ISMVL 2011: 230-235 - [c47]Josep Argelich
Analyzing the Instances of the MaxSAT Evaluation. SAT 2011: 360-361 - [e1]Cèsar Fernández, Hector Geffner, Felip Manyà:
Artificial Intelligence Research and Development - Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence, Lleida, Catalonia, Spain, October 26-28, 2011. Frontiers in Artificial Intelligence and Applications 232, IOS Press 2011, ISBN 978-1-60750-841-0 [contents] - [i1]Chu Min Li, Felip Manyà, Jordi Planes:
New Inference Rules for Max-SAT. CoRR abs/1111.0040 (2011) - 2010
- [j13]Chu Min Li, Felip Manyà
Resolution-based lower bounds in MaxSAT. Constraints An Int. J. 15(4): 456-484 (2010) - [c46]Josep Argelich
New Insights into Encodings from MaxCSP into Partial MaxSAT. ISMVL 2010: 46-52 - [c45]Chu Min Li, Felip Manyà
Exact MinSAT Solving. SAT 2010: 363-368
2000 – 2009
- 2009
- [c44]Ramón Béjar
Generating Hard Instances for MaxSAT. ISMVL 2009: 191-195 - [c43]Josep Argelich
Regular Encodings from Max-CSP into Partial Max-SAT. ISMVL 2009: 196-202 - [c42]Josep Argelich
Sequential Encodings from Max-CSP into Partial Max-SAT. SAT 2009: 161-166 - [c41]Chu Min Li, Felip Manyà
Exploiting Cycle Structures in Max-SAT. SAT 2009: 467-480 - [p1]Chu Min Li, Felip Manyà
MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability 2009: 613-631 - 2008
- [j12]Teresa Alsinet
An efficient solver for weighted Max-SAT. J. Glob. Optim. 41(1): 61-73 (2008) - [j11]Josep Argelich, Chu Min Li, Felip Manyà, Jordi Planes:
The First and Second Max-SAT Evaluations. J. Satisf. Boolean Model. Comput. 4(2-4): 251-278 (2008) - [c40]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Measuring the Hardness of SAT Instances. AAAI 2008: 222-228 - [c39]Chu Min Li, Felip Manyà
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. CP 2008: 582-587 - [c38]Josep Argelich
Encoding Max-CSP into Partial Max-SAT. ISMVL 2008: 106-111 - [c37]Josep Argelich
Modelling Max-CSP as Partial Max-SAT. SAT 2008: 1-14 - [c36]Josep Argelich
A Preprocessor for Max-SAT Solvers. SAT 2008: 15-20 - 2007
- [j10]Maria Luisa Bonet
Resolution for Max-SAT. Artif. Intell. 171(8-9): 606-618 (2007) - [j9]Carlos Ansótegui
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1-4): 191-205 (2007) - [j8]Ramón Béjar
Regular-SAT: A many-valued approach to solving combinatorial problems. Discret. Appl. Math. 155(12): 1613-1626 (2007) - [j7]Chu Min Li, Felip Manyà, Jordi Planes:
New Inference Rules for Max-SAT. J. Artif. Intell. Res. 30: 321-359 (2007) - [c35]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Inference Rules for High-Order Consistency in Weighted CSP. AAAI 2007: 167-172 - [c34]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
What Is a Real-World SAT Instance? CCIA 2007: 19-28 - [c33]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
The Logic Behind Weighted CSP. IJCAI 2007: 32-37 - [c32]Carlos Ansótegui
A Complete Resolution Calculus for Signed Max-SAT. ISMVL 2007: 22 - [c31]Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà:
Mapping CSP into Many-Valued SAT. SAT 2007: 10-15 - [c30]Josep Argelich, Felip Manyà:
Partial Max-SAT Solvers with Clause Learning. SAT 2007: 28-40 - 2006
- [j6]Josep Argelich
Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4-5): 375-392 (2006) - [c29]Chu Min Li, Felip Manyà, Jordi Planes:
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. AAAI 2006: 86-91 - [c28]Josep Argelich
Towards Solving Many-Valued MaxSAT. ISMVL 2006: 26 - [c27]Maria Luisa Bonet, Jordi Levy
A Complete Calculus for Max-SAT. SAT 2006: 240-251 - 2005
- [c26]Chu Min Li, Felip Manyà, Jordi Planes:
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. CP 2005: 403-414 - [c25]Josep Argelich
Solving Over-Constrained Problems with SAT. CP 2005: 838 - [c24]Carlos Ansótegui, Felip Manyà:
Mapping Many-Valued CNF Formulas to Boolean CNF Formulas. ISMVL 2005: 290-295 - [c23]Josep Argelich, Felip Manyà:
Solving Over-Constrained Problems with SAT Technology. SAT 2005: 1-15 - [c22]Teresa Alsinet, Felip Manyà, Jordi Planes:
Improved Exact Solvers for Weighted Max-SAT. SAT 2005: 371-377 - 2004
- [c21]Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cèsar Fernández, Felip Manyà:
Modeling Choices in Quasigroup Completion: SAT vs. CSP. AAAI 2004: 137-142 - [c20]Teresa Alsinet, Felip Manyà, Jordi Planes:
A Max-SAT Solver with Lazy Data Structures. IBERAMIA 2004: 334-342 - [c19]Carlos Ansótegui, Ramón Béjar, Alba Cabiscol, Felip Manyà:
The Interface between P and NP in Signed CNF Formulas. ISMVL 2004: 251-256 - [c18]Carlos Ansótegui, Felip Manyà:
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. SAT 2004 - [c17]Carlos Ansótegui, Felip Manyà:
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15 - 2003
- [j5]Felip Manyà, Carla P. Gomes:
Técnicas de resolución de problemas de satisfacción de restricciones. Inteligencia Artif. 7(19): 169-180 (2003) - [j4]Carlos Ansótegui, Felip Manyà:
Una introducción a los algoritmos de satisfactibilidad. Inteligencia Artif. 7(20): 43-56 (2003) - [j3]Teresa Alsinet
Automated monitoring of medical protocols: a secure and distributed architecture. Artif. Intell. Medicine 27(3): 367-392 (2003) - [c16]Carlos Ansótegui, Jose Larrubia, Felip Manyà:
Boosting Chaff's Performance by Incorporating CSP Heuristics. CP 2003: 96-107 - [c15]Carlos Ansótegui, Felip Manyà:
New Logical and Complexity Results for Signed-SAT. ISMVL 2003: 181-187 - [c14]Hantao Zhang, Haiou Shen, Felip Manyà
Exact Algorithms for MAX-SAT. FTP 2003: 190-203 - 2002
- [c13]Teresa Alsinet, Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà:
Minimal and Redundant SAT Encodings for the All-Interval-Series Problem. CCIA 2002: 139-144 - [c12]Carlos Ansótegui, Felip Manyà:
Bridging the Gap between SAT and CSP. CP 2002: 784-785 - 2001
- [j2]Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Extending the Reach of SAT with Many-Valued Logics. Electron. Notes Discret. Math. 9: 392-407 (2001) - [c11]Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Capturing Structure with Satisfiability. CP 2001: 137-152 - [c10]Ramón Béjar
A Modular Reduction of Regular Logic to Classical Logic. ISMVL 2001: 221-226 - 2000
- [c9]Ramón Béjar, Felip Manyà:
Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI 2000: 262-266 - [c8]Teresa Alsinet, Ramón Béjar, Cèsar Fernández, Felip Manyà:
A Multi-agent system architecture for monitoring medical protocols. Agents 2000: 499-505 - [c7]Bernhard Beckert, Reiner Hähnle, Felip Manyà:
The 2-SAT Problem of Regular Signed CNF Formulas. ISMVL 2000: 331-336
1990 – 1999
- 1999
- [c6]Ramón Béjar, Felip Manyà:
A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas. ESCQARU 1999: 22-31 - [c5]Ramón Béjar
Phase Transitions in the Regular Random 3-SAT Problem. ISMIS 1999: 292-300 - [c4]Bernhard Beckert, Reiner Hähnle, Felip Manyà:
Transformations between Signed and Classical Clause Logic. ISMVL 1999: 248-255 - [c3]Ramón Béjar, Felip Manyà:
Solving Combinatorial Problems with Regular Local Search Algorithms. LPAR 1999: 33-43 - 1998
- [j1]Felip Manyà, Ramón Béjar, Gonzalo Escalada-Imaz:
The satisfiability problem in regular CNF-formulas. Soft Comput. 2(3): 116-123 (1998) - 1994
- [c2]Gonzalo Escalada-Imaz, Felip Manyà:
Efficient Interpretation of Propositional Multiple-valued Logic Programs. IPMU 1994: 428-439 - [c1]Gonzalo Escalada-Imaz, Felip Manyà:
The Satisfiability Problem in Multiple-Valued Horn Formulae. ISMVL 1994: 250-256
Coauthor Index
[j38] [c89] [c88] [j37] [j36] [c87] [c86] [c83] [j35] [j32] [c81] [c80] [c79] [c78] [i5] [i4] [j31] [j30] [j29] [c77] [c76] [p2] [e2] [j28] [c75] [j26] [c74] [c73] [j24] [c72] [c71] [i2] [j23] [c70] [c67] [c66] [c65] [c64] [c63] [c61] [c58] [c56] [j17] [c54] [c53] [c50] [c49] [c47] [i1] [j13] [c45] [c41] [p1] [j11] [c39] [c36] [j9] [j7] [c29] [c28] [c26]
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-11-27 20:33 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: