default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Schaerf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]Sara Ceschia
, Andrea Schaerf:
Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities. Comput. Ind. Eng. 188: 109858 (2024)- [j60]Roberto Maria Rosati, Andrea Schaerf:
Multi-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem. Expert Syst. Appl. 255: 124484 (2024) - [c45]Eugenia Zanazzo, Sara Ceschia, Andrea Schaerf:
Solving the Integrated Patient-to-Room and Nurse-to-Patient Assignment by Simulated Annealing. MIC (1) 2024: 158-163 - [c44]Sara Ceschia, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf:
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling. MIC (1) 2024: 164-170 - [c43]Roberto Maria Rosati, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf:
Multi-Neighborhood Search for the Makespan Minimization Problem on Parallel Identical Machines with Conflicting Jobs. MIC (2) 2024: 373-379 - [c42]Sara Ceschia, Francesca Da Ros, Luca Di Gaspero, Andrea Schaerf:
EasyLocal++ a 25-year Perspective on Local Search Frameworks: The Evolution of a Tool for the Design of Local Search Algorithm. GECCO Companion 2024: 1658-1667 - 2023
- [j59]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Educational timetabling: Problems, benchmarks, and state-of-the-art results. Eur. J. Oper. Res. 308(1): 1-18 (2023) - [j58]Mats Carlsson, Sara Ceschia, Luca Di Gaspero, Rasmus Ø. Mikkelsen, Andrea Schaerf, Thomas Jacob Riis Stidsen:
Exact and metaheuristic methods for a real-world examination timetabling problem. J. Sched. 26(4): 353-367 (2023) - [j57]Florian Mischek, Nysret Musliu, Andrea Schaerf:
Local search approaches for the test laboratory scheduling problem with variable task grouping. J. Sched. 26(5): 457-477 (2023) - [j56]Marcelo Rodrigues de Holanda Maia, Miguel Reula, Consuelo Parreño-Torres, Prem Prakash Vuppuluri, Alexandre Plastino, Uéverton S. Souza, Sara Ceschia, Mario Pavone, Andrea Schaerf:
Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. Soft Comput. 27(8): 4685-4698 (2023) - [c41]Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf:
Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization. LOD (2) 2023: 206-221 - 2022
- [j55]Sara Ceschia, Kevin Roitero, Gianluca Demartini, Stefano Mizzaro, Luca Di Gaspero, Andrea Schaerf:
Task design in complex crowdsourcing experiments: Item assignment optimization. Comput. Oper. Res. 148: 105995 (2022) - [j54]Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf:
Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem. EURO J. Comput. Optim. 10: 100024 (2022) - [j53]Edoardo Bastianetto, Sara Ceschia, Andrea Schaerf:
Correction to: Solving a home energy management problem by Simulated Annealing. Optim. Lett. 16(3): 1103 (2022) - [j52]Arnaud De Coster, Nysret Musliu, Andrea Schaerf, Johannes Schoisswohl, Kate Smith-Miles:
Algorithm selection and instance space analysis for curriculum-based course timetabling. J. Sched. 25(1): 35-58 (2022) - [j51]Roberto Maria Rosati, Matteo Petris, Luca Di Gaspero, Andrea Schaerf:
Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021. J. Sched. 25(3): 301-319 (2022) - [j50]Maximilian Moser, Nysret Musliu, Andrea Schaerf, Felix Winter:
Exact and metaheuristic approaches for unrelated parallel machine scheduling. J. Sched. 25(5): 507-534 (2022) - [c40]Roberto Maria Rosati, Lucas Kletzander, Christian Blum, Nysret Musliu, Andrea Schaerf:
Construct, Merge, Solve and Adapt Applied to a Bus Driver Scheduling Problem with Complex Break Constraints. AI*IA 2022: 254-267 - [c39]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Simulated Annealing for the Home Healthcare Routing and Scheduling Problem. AI*IA 2022: 402-412 - [c38]Andrea Ecoretti, Sara Ceschia, Andrea Schaerf:
Local Search for Integrated Predictive Maintenance and Scheduling in Flow-Shop. MIC 2022: 260-273 - [i9]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results. CoRR abs/2201.07525 (2022) - 2021
- [j49]Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Comput. Oper. Res. 132: 105300 (2021) - [j48]Edoardo Bastianetto, Sara Ceschia, Andrea Schaerf:
Solving a home energy management problem by Simulated Annealing. Optim. Lett. 15(5): 1553-1564 (2021) - 2020
- [j47]Sara Ceschia, Rosita Guido, Andrea Schaerf:
Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods. Ann. Oper. Res. 288(1): 95-113 (2020) - [j46]Davide Armellini, Paolo Borzone, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Modeling and solving the steelmaking and casting scheduling problem. Int. Trans. Oper. Res. 27(1): 57-90 (2020) - [c37]Michele Battistutta, Sara Ceschia, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf, Elena Topan:
Local Search and Constraint Programming for a Real-World Examination Timetabling Problem. CPAIOR 2020: 69-81
2010 – 2019
- 2019
- [j45]Sara Ceschia, Nguyen Dang, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf:
The Second International Nurse Rostering Competition. Ann. Oper. Res. 274(1-2): 171-186 (2019) - [j44]Ender Özcan, Edmund K. Burke, Luca Di Gaspero, Barry McCollum, Andrea Schaerf:
The practice and theory of automated timetabling (2016). Ann. Oper. Res. 275(1): 1-2 (2019) - [j43]Michele Battistutta, Sara Ceschia, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf:
Modelling and solving the thesis defense timetabling problem. J. Oper. Res. Soc. 70(7): 1039-1050 (2019) - 2017
- [j42]Michele Battistutta, Andrea Schaerf, Tommaso Urli:
Feature-based tuning of single-stage simulated annealing for examination timetabling. Ann. Oper. Res. 252(2): 239-254 (2017) - [j41]Alex Bonutti, Sara Ceschia, Fabio De Cesco, Nysret Musliu, Andrea Schaerf:
Modeling and solving a real-life multi-skill shift design problem. Ann. Oper. Res. 252(2): 365-382 (2017) - [j40]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming. Comput. Ind. Eng. 114: 235-243 (2017) - 2016
- [j39]Gerhard Post, Luca Di Gaspero, Jeffrey H. Kingston, Barry McCollum, Andrea Schaerf:
The Third International Timetabling Competition. Ann. Oper. Res. 239(1): 69-75 (2016) - [j38]Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, Tommaso Urli:
Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput. Oper. Res. 65: 83-92 (2016) - [j37]Sara Ceschia, Andrea Schaerf:
Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays. J. Sched. 19(4): 377-389 (2016) - 2015
- [i8]Sara Ceschia, Nguyen Dang Thi Thanh, Patrick De Causmaecker, Stefaan Haspeslagh, Andrea Schaerf:
Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -. CoRR abs/1501.04177 (2015) - 2014
- [j36]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
The generalized balanced academic curriculum problem with heterogeneous classes. Ann. Oper. Res. 218(1): 147-163 (2014) - [j35]Stefaan Haspeslagh, Patrick De Causmaecker, Andrea Schaerf, Martin Stølevik:
The first international nurse rostering competition 2010. Ann. Oper. Res. 218(1): 221-236 (2014) - [j34]Gerhard Post, Jeffrey H. Kingston, Samad Ahmadi, Sophia Daskalaki, Christos Gogos, Jari Kyngäs, Cimmo Nurmi, Nysret Musliu, Nelishia Pillay, Haroldo G. Santos, Andrea Schaerf:
XHSTT: an XML archive for high school timetabling problems in different countries. Ann. Oper. Res. 218(1): 295-301 (2014) - [i7]Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf, Tommaso Urli:
Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. CoRR abs/1409.7186 (2014) - 2013
- [j33]Sara Ceschia, Andrea Schaerf, Thomas Stützle:
Local search techniques for a routing-packing problem. Comput. Ind. Eng. 66(4): 1138-1149 (2013) - [j32]Sara Ceschia, Andrea Schaerf:
Local search for a multi-drop multi-container loading problem. J. Heuristics 19(2): 275-294 (2013) - [j31]Luigi Palopoli, Andrea Schaerf:
The \sc np-spec{\sc np-spec} Project. Intelligenza Artificiale 7(1): 37-44 (2013) - [p1]Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany:
Automated Shift Design and Break Scheduling. Automated Scheduling and Planning 2013: 109-127 - 2012
- [j30]Alex Bonutti, Fabio De Cesco, Luca Di Gaspero, Andrea Schaerf:
Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. Ann. Oper. Res. 194(1): 59-70 (2012) - [j29]Sara Ceschia, Andrea Schaerf:
Modeling and solving the dynamic patient admission scheduling problem under uncertainty. Artif. Intell. Medicine 56(3): 199-205 (2012) - [j28]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput. Oper. Res. 39(7): 1615-1624 (2012) - [j27]Marco Chiarandini, Luca Di Gaspero, Stefano Gualandi, Andrea Schaerf:
The balanced academic curriculum problem revisited. J. Heuristics 18(1): 119-148 (2012) - [j26]Ruggero Bellio, Luca Di Gaspero, Andrea Schaerf:
Design and statistical analysis of a hybrid local search algorithm for course timetabling. J. Sched. 15(1): 49-61 (2012) - 2011
- [j25]Sara Ceschia, Andrea Schaerf:
Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 38(10): 1452-1463 (2011) - [j24]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs. J. Sched. 14(6): 601-615 (2011) - [c36]Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf:
Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings. LION 2011: 450-453 - [c35]Andrea Schaerf:
A Survey of Multi-Agent Systems for Optimization Problems. WOA 2011: 1 - [i6]Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Design, Engineering, and Experimental Analysis of a Simulated Annealing Approach to the Post-Enrolment Course Timetabling Problem. CoRR abs/1104.2518 (2011) - 2010
- [j23]Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke:
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS J. Comput. 22(1): 120-130 (2010) - [c34]Luca Di Gaspero, Johannes Gärtner, Nysret Musliu, Andrea Schaerf, Werner Schafhauser, Wolfgang Slany:
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem. Hybrid Metaheuristics 2010: 46-61
2000 – 2009
- 2009
- [c33]Sara Ceschia, Andrea Schaerf:
Multi-neighborhood Local Search for the Patient Admission Problem. Hybrid Metaheuristics 2009: 156-170 - [e1]Maria J. Blesa, Christian Blum, Luca Di Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf:
Hybrid Metaheuristics, 6th International Workshop, HM 2009, Udine, Italy, October 16-17, 2009. Proceedings. Lecture Notes in Computer Science 5818, Springer 2009, ISBN 978-3-642-04917-0 [contents] - 2008
- [c32]Luca Di Gaspero, Andrea Schaerf:
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem. Hybrid Metaheuristics 2008: 146-157 - [c31]Ruggero Bellio, Luca Di Gaspero, Andrea Schaerf:
A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm for Course Timetabling Problems. RCRA 2008 - 2007
- [j22]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The minimum shift design problem. Ann. Oper. Res. 155(1): 79-105 (2007) - [j21]Luca Di Gaspero, Andrea Schaerf:
A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13(2): 189-207 (2007) - [c30]Luca Di Gaspero, Giacomo di Tollo, Andrea Roli, Andrea Schaerf:
Hybrid Local Search for Constrained Financial Portfolio Selection Problems. CPAIOR 2007: 44-58 - [c29]Igor Pesek, Andrea Schaerf, Janez Zerovnik:
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem. Hybrid Metaheuristics 2007: 57-68 - [c28]Luca Di Gaspero, Andrea Roli, Andrea Schaerf:
EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms. SLS 2007: 76-90 - [c27]Luca Di Gaspero, Andrea Schaerf:
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms. SLS 2007: 177-181 - 2006
- [j20]Luca Di Gaspero, Andrea Schaerf:
Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems. J. Math. Model. Algorithms 5(1): 65-89 (2006) - [c26]Luca Di Gaspero, Marco Chiarandini, Andrea Schaerf:
A Study on the Short-Term Prohibition Mechanisms in Tabu Search. ECAI 2006: 83-87 - [c25]Andrea Schaerf, Luca Di Gaspero:
Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals. PATAT 2006: 40-49 - 2005
- [j19]Marco Cadoli, Andrea Schaerf:
: Compiling problem specifications into SAT. Artif. Intell. 162(1-2): 89-120 (2005) - 2004
- [j18]Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
Local search for shift design. Eur. J. Oper. Res. 153(1): 51-64 (2004) - [j17]Luca Di Gaspero, Andrea Schaerf:
The course timetabling problem: theory and practice. Intelligenza Artificiale 1(3): 47-54 (2004) - 2003
- [j16]Amnon Meisels, Andrea Schaerf:
Modelling and Solving Employee Timetabling Problems. Ann. Math. Artif. Intell. 39(1-2): 41-59 (2003) - [j15]Luca Di Gaspero, Andrea Schaerf:
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms. Softw. Pract. Exp. 33(8): 733-765 (2003) - [c24]Luca Di Gaspero, Johannes Gärtner, Guy Kortsarz, Nysret Musliu, Andrea Schaerf, Wolfgang Slany:
The Minimum Shift Design Problem: Theory and Practice. ESA 2003: 593-604 - 2002
- [c23]Luca Di Gaspero, Andrea Schaerf:
Multi-neighbourhood Local Search with Application to Course Timetabling. PATAT 2002: 262-275 - 2001
- [c22]Marco Cadoli, Andrea Schaerf:
Compiling Problem Specifications into SAT. ESOP 2001: 387-401 - [i5]Andrea Schaerf:
Local Search Techniques for Constrained Portfolio Selection Problems. CoRR cs.CE/0104017 (2001) - 2000
- [j14]Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, Domenico Vasile:
NP-SPEC: an executable specification language for solving all problems in NP. Comput. Lang. 26(2-4): 165-195 (2000) - [j13]Andrea Schaerf, Marco Cadoli, Maurizio Lenzerini:
LOCAL++: A C++ framework for local search algorithms. Softw. Pract. Exp. 30(3): 233-257 (2000) - [c21]Luca Di Gaspero, Andrea Schaerf:
Tabu Search Techniques for Examination Timetabling. PATAT 2000: 104-117 - [i4]Krzysztof R. Apt, Andrea Schaerf:
Programming in Alma-0, or Imperative and Declarative Programming Reconciled. CoRR cs.LO/0004002 (2000)
1990 – 1999
- 1999
- [j12]Andrea Schaerf:
A Survey of Automated Timetabling. Artif. Intell. Rev. 13(2): 87-127 (1999) - [j11]Andrea Schaerf:
Scheduling Sport Tournaments using Constraint Logic Programming. Constraints An Int. J. 4(1): 43-65 (1999) - [j10]Andrea Schaerf:
Local search techniques for large high school timetabling problems. IEEE Trans. Syst. Man Cybern. Part A 29(4): 368-377 (1999) - [c20]Andrea Schaerf, Amnon Meisels:
Solving Employee Timetabling Problems by Generalized Local Search. AI*IA 1999: 380-389 - [c19]Krzysztof R. Apt, Andrea Schaerf:
The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming. Correct System Design 1999: 89-113 - [c18]Marco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile:
NP-SPEC: An Executable Specification Language for Solving All Problems in NP. PADL 1999: 16-30 - [c17]Andrea Schaerf, Maurizio Lenzerini, Marco Cadoli:
LOCAL++: A C++ Framework for Local Search Algorithms. TOOLS (29) 1999: 152-161 - [i3]Krzysztof R. Apt, Andrea Schaerf:
The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming. CoRR cs.LO/9907027 (1999) - 1998
- [j9]Martin Buchheit, Francesco M. Donini, Werner Nutt, Andrea Schaerf:
A Refined Architecture for Terminological Systems: Terminology = Schema + Views. Artif. Intell. 99(2): 209-260 (1998) - [j8]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Andrea Schaerf:
An Epistemic Operator for Description Logics. Artif. Intell. 100(1-2): 225-274 (1998) - [j7]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf:
AL-log: Integrating Datalog and Description Logics. J. Intell. Inf. Syst. 10(3): 227-252 (1998) - [j6]Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf:
Alma-O: An Imperative Language That Supports Declarative Programming. ACM Trans. Program. Lang. Syst. 20(5): 1014-1066 (1998) - [c16]Krzysztof R. Apt, Andrea Schaerf:
Programming in Alma-0, or Imperative and Declarative Programming Reconciled. FroCoS 1998: 1-18 - 1997
- [c15]Andrea Schaerf:
Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems. IJCAI 1997: 1254-1259 - [c14]Krzysztof R. Apt, Andrea Schaerf:
Search and Imperative Programming. POPL 1997: 67-79 - 1996
- [c13]Andrea Schaerf:
Tabu Search Techniques for Large High-School Timetabling Problems. AAAI/IAAI, Vol. 1 1996: 363-368 - [c12]Andrea Schaerf:
Scheduling Sport Tournaments using Constraint Logic Programming. ECAI 1996: 634-638 - 1995
- [j5]Andrea Schaerf, Yoav Shoham, Moshe Tennenholtz:
Adaptive Load Balancing: A Study in Multi-Agent Learning. J. Artif. Intell. Res. 2: 475-500 (1995) - [i2]Andrea Schaerf, Yoav Shoham, Moshe Tennenholtz:
Adaptive Load Balancing: A Study in Multi-Agent Learning. CoRR cs.AI/9505102 (1995) - 1994
- [j4]Andrea Schaerf:
Reasoning with Individuals in Concept Languages. Data Knowl. Eng. 13(2): 141-176 (1994) - [j3]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf:
Deduction in Concept Languages: From Subsumption to Instance Checking. J. Log. Comput. 4(4): 423-452 (1994) - [c11]Martin Buchheit, Werner Nutt, Francesco M. Donini, Andrea Schaerf:
Refining the Structure of Terminological Systems: Terminology = Schema + Views. AAAI 1994: 199-204 - [c10]Martin Buchheit, Francesco M. Donini, Werner Nutt, Andrea Schaerf:
Terminological Systems Revisited: Terminology = Schema + Views. KRDB 1994 - 1993
- [j2]Martin Buchheit, Francesco M. Donini, Andrea Schaerf:
Decidable Reasoning in Terminological Knowledge Representation Systems. J. Artif. Intell. Res. 1: 109-138 (1993) - [j1]Andrea Schaerf:
On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification. J. Intell. Inf. Syst. 2(3): 265-278 (1993) - [c9]Andrea Schaerf:
Reasoning with Individuals in Concept Languages. AI*IA 1993: 108-119 - [c8]Martin Buchheit, Francesco M. Donini, Andrea Schaerf:
Decidable Reasoning in Terminological Knowledge Representation Systems. IJCAI 1993: 704-709 - [c7]Andrea Schaerf:
On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification. ISMIS 1993: 508-517 - [i1]Martin Buchheit, Francesco M. Donini, Andrea Schaerf:
Decidable Reasoning in Terminological Knowledge Representation Systems. CoRR cs.AI/9312101 (1993) - 1992
- [c6]Andrea Schaerf:
On the Role of Subsumption Algorithms in Concept Description Languages. Description Logics 1992: 86-97 - [c5]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Andrea Schaerf:
Queries, Rules and Definitions as Epistemic Sentences in Concept Languages. ECAI Workshop on Knowledge Representation and Reasoning 1992: 113-132 - [c4]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf, Werner Nutt:
Adding Epistemic Operators to Concept Languages. KR 1992: 342-353 - 1991
- [c3]Maurizio Lenzerini, Andrea Schaerf:
Concept Languages as Query Languages. AAAI 1991: 471-476 - [c2]Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf:
A Hybrid System with Datalog and Concept Languages. AI*IA 1991: 88-97 - [c1]Maurizio Lenzerini, Andrea Schaerf:
Querying Concept-based Knowledge Bases. PDK 1991: 107-123
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-08-23 18:35 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:
