December 2018 - finite-model-theory

DICE-FOPARA 2019: Call for Papers

by Thomas Seiller

CALL FOR PAPERS DICE-FOPARA 2019 Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis 6-7 April 2019, Prague; Satellite event of ETAPS 2019 https://conf.researchr.org/track/etaps-2019/dice-fopara-2019-papers ** OBJECTIVES ** The joint DICE-FOPARA workshop provides synergies by combining two complementary communities: The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. Several approaches have been explored for that purpose, such as restrictions on primitive recursion and ramification, rewriting systems, linear logic, types and lambda calculus, interpretations of functional and imperative programs. The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. The joint DICE-FOPATA workshop at ETAPS 2019 follows the successful experiences of co-location of DICE-FOPARA at ETAPS 2015 in London and ETAPS 2017 in Uppsala. ** TOPICS ** The joint workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice. Areas of interest to the workshop include, but are not limited to, the following: - type systems for controlling/inferring/checking complexity; - logical and machine-independent characterisations of complexity classes; - programming languages for complexity-bounded computation; - logics closely related to complexity classes; - theoretical foundations of program complexity analysis; - static resource analysis and practical applications; - resource analysis by term and graph rewriting. - semantics of complexity-bounded computation; - applications of implicit complexity to security; - termination and resource analysis for probabilistic programs; - semantic methods to analyse resources, including quasi-interpretations; - practical applications of resource analysis; ** SUBMISSIONS ** We ask for submission of regular papers describing original work (up to 15 pages) or extended abstracts (up to 5 pages) presenting already published work or work in progress. With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been already published, nor is presently submitted, elsewhere. With respect to submissions of extended abstracts, the goal is to provide a forum for discussing work in progress, but presentations of already published results are also welcome, provided those are within the scope of the workshop and potentially give rise to lively discussions during the meeting. A special issue of an international journal devoted to the joint workshop may be proposed. In this case, the CFP will be posted after the workshop and will be open to long versions of papers presented at this venue, as well as other submissions relevant to the scientific scope. Papers must be prepared using the LaTeX EPTCS style (http://style.eptcs.org/). Papers should be submitted electronically via the easychair submission page: https://easychair.org/conferences/?conf=dicefopara2019 ** IMPORTANT DATES ** Paper Submission -- January 31st, 2019 Author Notification -- February 21st, 2019 Final Version -- February 28th, 2019 Workshop -- April 6th and 7th, 2019 ** PROGRAM COMMITTEE ** Chairs: Steffen Jost, LMU, Munich, DE Thomas Seiller, CNRS, LIPN, Villetaneuse, FR Progam Committee: Robert Atkey, University of Strathclyde, Glasgow, UK Martin Avanzini, INRIA, Sophia Antipolis, FR Lennart Beringer, Princeton University, US Ezgi Cicek, Facebook, London, UK Lukasz Czajka, TU Dortmund, DE Ankush Das, Carnegie Mellon University, Pittsburgh, US Hugo Feree, University of Kent, UK Samir Genaim, Universidad Complutense de Madrid, ES Hans-Wolfgang Loidl, Heriot-Watt University, Edinburgh, UK Joanna Ochremiak, University of Cambridge, UK Romain Pechoux, Université de Lorraine, FR Paolo Pistone, Universität Tübingen, DE Pedro Vasconcelos, University of Porto, PT Margherita Zorzi, Università degli Studi di Verona, IT

5 years, 8 months

1
1
0 0

STACS 2019: Accepted Papers and First Call for Participation

by Rolf Niedermeier

======================================================================== STACS 2019 36th International Symposium on Theoretical Aspects of Computer Science March 13—16, 2019, TU Berlin, Berlin, Germany ======================================================================== The accepted papers and more information can be found via https://stacs2019.akt.tu-berlin.de/ The scientific program consists of three invited talks, two tutorial talks, and presentations of 54 contributed papers (selected from more than 260 submitted papers). It will start on March 13 early afternoon with the two tutorials and it will end on March 16 early afternoon. More details concerning program arrangements etc. will be added soon. The registration (via webpage above) is open. Early registration deadline: January 31, 2019, AoE.

5 years, 9 months

1
0
0 0

ICDT2020 CfP - First Submission Cycle

by Carsten Lutz

CALL FOR PAPERS 23rd INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2020) Copenhagen, Denmark, March 30 - April 2, 2020 * About ICDT ICDT is an international conferences series that addresses the principles and theory of data management. Since 2009, it is annually and jointly held with EDBT, the international conference on extending database technology. See also https://databasetheory.org/icdt-pages. * Broadening Scope As ICDT strives to broaden its scope, ICDT 2020 will have a Reach Out Track that calls for - novel formal frameworks or directions for database theory and/or - connections between principles of data management and other communities. The aim of the Reach Out track is to present novel and important directions for database theory and to expand the scope and impact of ICDT towards neighboring communities such as Database Systems, Artificial Intelligence, Knowledge Representation, Machine Learning, Programming Languages, Distributed Computing, and Operating Systems. It is reasonable for articles submitted to this track to be be shorter than regular ICDT submissions. Submissions will be judged mainly in terms of their potential to lead to valuable and impactful theoretical developments. We encourage authors to illustrate the potential impact via convincing examples, preliminary results, and clearly specified open problems. * Topics of Interest Every topic related to the principles of data management is relevant to ICDT. Particularly welcome are contributions that connect data management to theoretical computer science, and those that connect database theory and database practice. Examples of relevant topics include: - Data mining, information extraction, information retrieval, and database aspects of machine learning - Data models, design, structures, semantics, query languages, and algorithms for data management - Distributed and parallel databases, cloud computing - Databases and knowledge representation - Graph databases, (semantic) Web data, and Web services - Data streams and sketching - Data-centric (business) process management and workflows - Data and knowledge integration and exchange, data provenance, views, and data warehouses - Domain-specific databases (multimedia, scientific, spatial, etc) - Data privacy and security, concurrency, and recovery * Submission Cycles and Dates ICDT has two submission cycles, the first providing the possibility of a revision. First cycle abstract deadline: March 27, 2019 Full paper submission deadline: April 3, 2019 Notification: May 29, 2019 Second cycle abstract deadline: September 15, 2019 Full paper submission deadline: September 23, 2019 Notification: December 5, 2019 * Program Committee Program Committee Chair: Carsten Lutz (University of Bremen) Program Committee Members: Marcelo Arenas (PUC, Santiago de Chile) Michael Benedikt (University of Oxford) Christoph Berkholz (HU Berlin) Angela Bonifati (University Lyon 1) Pierre Bourhis (University of Lille) James Cheney (University of Edinburgh) Graham Cormode (University of Warwick) Victor Dalmau (UPF, Barcelona) Claire David (University Paris-Est) Floris Geerts (University of Antwerp) Bas Ketsman (EPFL, Lausanne) Daniel Kifer (Penn State University) Leonid Libkin (University of Edinburgh) Sebatian Maneth (University of Bremen) Filip Murlak (University of Warsaw) Reinhard Pichler (TU Vienna) Andreas Pieris (University of Edinburgh) Sebastian Rudolph (TU Dresden) Thomas Schwentick (University of Dortmund) Uri Stemmer (Ben-Gurion University, Negev) Domagoj Vrgoc (PUC, Santiago de Chile) Frank Wolter (University of Liverpool) * Submission Instructions Submissions will be electronic via EasyChair at https://easychair.org/conferences/?conf=icdt2020. Papers must be written in English and provide sufficient detail to allow the program committee to assess their merits. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia, workshops, and journals. Papers must be submitted as a PDF document and use the LIPIcs style (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors). Paper length is limited to 15 pages excluding references, both for regular submissions and for the Reach Out Track. Additional details may be included in a clearly marked appendix which will be read at the discretion of the program committee. Online appendices are not allowed. Papers that do not conform to these requirements may be rejected without further consideration. The proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees that the proceedings will be available under the gold open access model, that is, online and free of charge while the authors retain the rights over their work. At least one author of each accepted paper is expected to register at the conference and to present the paper. * Awards An award will be given to the Best Paper and to the Best Newcomer Paper where `newcomer' refers to the field of database theory. The latter award will preferentially be given to a paper authored only by students and in that case be called Best Student-Paper Award. The program committee reserves the right to not give any award and to split an award among several papers. Papers co-authored by program committee members are not eligible for an award.

5 years, 9 months

1
0
0 0

Call for Nominations: VCLA International Student Awards 2019 - Logic and Computer Science

by Mihaela Rozman

The Vienna Center for Logic and Algorithms (VCLA) at TU Wien seeks nominations for the VCLA International Student Awards 2019. The annually awarded VCLA International Student Awards for Outstanding Master and Undergraduate Research (Bachelor) Theses (or equivalent) recognize authors of scientific works across the wide spectrum of Logic and Computer Science. Final Submission Deadline: 15.3.2019 AWARD *Outstanding Master Thesis Award: 1200 EUR *Outstanding Undergraduate Research (Bachelor) Award: 800 EUR *The winners will be invited to present their work at an award ceremony in Vienna, Austria. ELIGIBILITY *The degree must have been awarded between November 15th, 2017, and December 31st, 2018, (inclusive). *Students who obtained their degree at TU Wien are excluded from the nomination. MAIN AREAS OF INTEREST *Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, algorithmic lower and upper bounds, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics), computational complexity and algorithms (complexity analysis, parameterized and exact algorithms, decomposition methods). *Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). *Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems. NOMINATION REQUIREMENTS *For nomination instructions, please visit <https://logic-cs.at/award-call-2019/> https://logic-cs.at/award-call-2019/ *Kindly address all inquiries to <mailto:award@logic-cs.at> award(a)logic-cs.at IMPORTANT DATES *Final submission deadline: March 15, 2019 (AoE) *Notification of decision: end of June 2019 *Award ceremony: September 2019, Vienna (Austria) AWARD COMMITTEE 2019 To be announced in January 2019. For the VCLA Award Committee 2018 see: <http://www.vcla.at/vcla-awards/> http://www.vcla.at/vcla-awards/ *Robert Ganian (committee co-chair) *Magdalena Ortiz (general chair) *Revantha Ramanayake (committee co-chair) IN MEMORIAM The award is dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aims to carry on his commitment to promoting young talent and promising researchers in these areas. RECIPIENTS OF THE VCLA INTERNATIONAL STUDENT AWARDS <http://www.vcla.at/vcla-awards/> http://www.vcla.at/vcla-awards/ Please feel free to distribute as appropriate.

5 years, 9 months

1
0
0 0

1st World Logic Day: January 14, 2019

by jean-yves beziau

The basic idea of a World Logic Day is to put logic in its right place, i.e the first place: 1st World Logic Day, January 14, 2019: http://www.logica-universalis.org/wld

5 years, 9 months

1
0
0 0

EPIT 2019 - Spring school on databases, logic and automata - April 7-12, 2019 - Marseille, France

by Cristina Sirangelo

===================================================================== EPIT 2019 - Spring school on databases, logic and automata CIRM - Centre International de Rencontres Mathématiques - Marseille Luminy - France April 7-12, 2019 https://conferences.cirm-math.fr/1934.html <https://conferences.cirm-math.fr/1934.html> ===================================================================== **** NEWS **** *** !!! Registration fees will be no more than 50 Euros per participant !!! (much less than previously announced). Registration is free for CNRS agents. *** Pre-registration is open (until January 13, 2019) Please pre-register at https://conferences.cirm-math.fr/1934.html <https://conferences.cirm-math.fr/1934.html> IMPORTANT : Note that registration will be finalised only after receiving confirmation from us, and paying registration fees. ===================================================================== EPIT (École de Printemps d'Informatique Théorique, https://epit.irif.fr/ <https://epit.irif.fr/>) is a French recurrent spring school in theoretical computer science, initiated by Maurice Nivat in 1973. It has since then spanned many exciting topics in foundational computer science, and has become a major event for the research community in France and beyond. The 2019 edition of the EPIT will cover the foundations of data management. It will in particular focus on the fruitful interaction between database theory and two other main areas of theoretical computer science : logic and automata - as well as other closely related fields, such as finite model theory, descriptive complexity, game theory, and inference. Programme --------- Sunday * Arrival before dinner Monday * Morning: Introduction to database theory (Pierre Senellart, ENS Paris) * Afternoon : - Optimal joins (Szymon Toruńczyk, Warsaw) - Poster session Tuesday * Morning: Logic and automata for semi-structured data (Diego Figueira, Bordeaux) * Afternoon: - Logic-based distributed query processing (Frank Neven, Hasselt) - Incremental query evaluation (Thomas Schwentick, Dortmund) Wednesday * Morning: Graph data management (Wim Martens, Beyreuth) Thursday * Morning: Databases and descriptive complexity (Nicole Schweikardt, Humboldt) * Afternoon: - View-based query processing (Nadime Francis, Marne la Vallée) - Incomplete data management (Leonid Libkin, Edinburgh) Friday * Morning : Ontologies and rules (Meghyn Bienvenu, Montpellier) Poster sessions will be organised, so that participants who are willing to, will be able to present their work. All courses will be given in English. A detailed schedule of activities is available here https://www.cirm-math.fr/ProgWeebly/2019/Renc1934/Prog1934.pdf <https://www.cirm-math.fr/ProgWeebly/2019/Renc1934/Prog1934.pdf>. Audience ------------ Lectures are intended to be accessible to a wide audience. No prior knowledge of database theory will be assumed, but some familiarity with basic automata theory and logic is recommended. The EPIT 2019 Spring School is primarily addressed to PhD students and young researchers, but more senior participants are also encouraged to join. Date and Venue -------------- The EPIT 2019 Spring School will take place from Monday, April 8th to Friday, April 12th, 2019 in France, at CIRM, the International Center for Mathematical Meetings (https://www.cirm-math.fr/ <https://www.cirm-math.fr/>) in Luminy, Marseille. Directions for reaching CIRM are available here https://www.cirm-math.com/getting-to-cirm.html <https://www.cirm-math.com/getting-to-cirm.html>. Consider arriving at CIRM on Sunday April 7th before dinner and leaving on Friday April 12th after lunch. Registration ----------- Pre-registration is open on the Webpage of the event https://conferences.cirm-math.fr/1934.html <https://conferences.cirm-math.fr/1934.html> until January 13th 2019. IMPORTANT : after pre-registration you will have to wait for our confirmation before proceeding to the payment of registration fees. Only then the registration will be finalised. We plan to enable registration a week after the pre-registration deadline at the latest. Registration fees, including accommodation and meals at CIRM, will be at most 50 Euros per participant (much less than previously announced). Registration will be free for CNRS agents. Organisation ------------ The school is organised by : Amélie Gheerbrant <amelie(a)irif.fr <mailto:amelie@irif.fr>> Leonid Libkin <libkin(a)inf.ed.ac.uk <mailto:libkin@inf.ed.ac.uk>> Luc Segoufin <luc.segoufin(a)inria.fr <mailto:luc.segoufin@inria.fr>> Pierre Senellart <pierre(a)senellart.com <mailto:pierre@senellart.com>> Cristina Sirangelo <cristina(a)irif.fr <mailto:cristina@irif.fr>> For any further information please contact the organisers.

5 years, 10 months

1
0
0 0

Paraconsistent Newsletter - Fall 2018

by jean-yves beziau

With an exclusive interview with Michael Dunn The latest inconsistent papers, books, events, videos and a terrrific enigma that may lead you to the island of inconsistency ... http://www.paraconsistency.org/2018fall

5 years, 10 months

1
0
0 0

Caleidoscope Complexity School: Call for Participation

by Damiano Mazza

*** Call for participation*** Caleidoscope: Research School in Computational Complexity Institut Henri Poincaré, Paris, 17-21 June 2019 http://caleidoscope.sciencesconf.org/ Dear all, We are delighted to announce the Caleidoscope Research School in Computational Complexity, to take place at the Institut Henri Poincaré, Paris 17-21 June 2019. The school is aimed at graduate students and researchers who already work in some aspects of computational complexity and/or who would like to learn about the various approaches. DESCRIPTION Computational complexity theory was born more than 50 years ago when researchers started asking themselves what could be computed efficiently. Classifying problems/functions with respect to the amount of resources (e.g. time and/or space) needed to solve/compute them turned out to be an extremely difficult question. This has led researchers to develop a remarkable variety of approaches, employing different mathematical methods and theories. The future development of complexity theory will require a subtle understanding of the similarities, differences and limitations of the many current approaches. In fact, even though these study the same phenomenon, they are developed today within disjoint communities, with little or no communication between them (algorithms, logic, programming theory, algebra...). This dispersion is unfortunate since it hinders the development of hybrid methods and more generally the advancement of computational complexity as a whole. The goal (and peculiarity) of the Caleidoscope school is to reunite in a single event as many different takes on computational complexity as can reasonably be fit in one week. It is intended for graduate students as well as established researchers who wish to learn more about neighbouring areas. LECTURES 1. Boolean circuits and lower bounds. (Rahul Santhanam, University of Oxford) 2. Algebraic circuits and geometric complexity. (Peter Bürgisser, Technical University Berlin) 3. Proof complexity and bounded arithmetic. (Sam Buss, University of California San Diego) 4. Machine-free complexity (descriptive and implicit complexity). (Anuj Dawar, University of Cambridge and Ugo Dal Lago, University of Bologna) In addition to these broad-ranging themes, there will also be three more focussed topics, providing examples of (already established or potential) interactions between logic, algebra and complexity: 5. Constraint satisfaction problems. (Libor Barto, Charles University in Prague) 6. Communication complexity. (Sophie Laplante, Paris 7 University) 7. Duality in formal languages and logic. (Daniela Petrisan, Paris 7 University) REGISTRATION Registration to the school is free but mandatory. This is to help us plan tea/coffee breaks and social activities. https://caleidoscope.sciencesconf.org/registration/index FINANCIAL SUPPORT There may be opportunities for financial support for participants. We will make relevant information available via the webpage. https://caleidoscope.sciencesconf.org/ SPONSORS European Association for Computer Science Logic (http://www.eacsl.org/) DIM RFSI - Région Île-de-France (https://dim-rfsi.fr/) Université Paris 13 (https://www.univ-paris13.fr/) Laboratoire d'Informatique de Paris Nord (https://lipn.univ-paris13.fr/)

5 years, 10 months

1
0
0 0

FSCD 2021 - CALL FOR LOCATION

by Sandra Alves

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2021 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 6th FSCD International Conference to be held during the summer of 2021. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020. Therefore, for 2021, we particularly encourage proposals outside Europe. The deadline for proposals is *** 31st March 2019 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information above). We encourage proposers to register their intention informally as soon as possible. Selected proposals are to be presented at the business meeting of FSCD 2019 taking place at Dortmund in June 2019. The final decision about hosting and organising of FSCD 2021 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. Proposals should address the following points: FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. National, regional, and local government and industry support, both organizational and financial. Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. Estimated costs on registration for the conference and workshops, both for regular and student participants. Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: number, capacity and audiovisual equipment of meeting rooms; a large plenary session room that can hold all the registrants; enough rooms for parallel sessions/workshops/tutorials; internet connectivity and workstations for demos/competitions; catering services; and presence of professional staff. Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Delia Kesner kesner(a)irif.fr FSCD SC Chair

5 years, 10 months

1
0
0 0

Description Logics workshop 2019, preliminary CfP

by Evgenij Thorstensen

--------------------------------------------------------------------- ---------- PRELIMINARY CALL FOR PAPERS 32nd International Workshop on Description Logics, DL 2019 June 18th to June 21st, 2019 - Oslo, Norway http://dl.kr.org/dl2019/ --------------------------------------------------------------------- ---------- The DL workshop is the major annual event of the description logic research community. It is the forum at which those interested in description logics, both from academia and industry, meet to discuss ideas, share information and compare experiences. The 32nd edition will be held in Oslo, Norway from June 18th to June 21st, 2019. Important Dates =============== Paper registration deadline: March 22, 2019 Paper submission deadline: March 29, 2019 Notification of acceptance: May 3, 2019 Camera-ready copies: May 24, 2019 Workshop: June 18-21, 2019 Workshop Scope ============== We invite contributions on all aspects of description logics, including but not limited to: * Foundations of description logics: decidability and complexity of reasoning, expressive power, novel inference problems, inconsistency management, reasoning techniques, and modularity aspects * Extensions of description logics: closed-world and nonmonotonic reasoning, epistemic reasoning, temporal and spatial reasoning, procedural knowledge, query answering, reasoning over dynamic information * Integration of description logics with other formalisms: object- oriented representation languages, database query languages, constraint-based programming, logic programming, and rule-based systems * Applications and use areas of description logics: ontology engineering, ontology languages, databases, ontology-based data access, semi- structured data, graph structured data, linked data, document management, natural language, learning, planning, Semantic Web, cloud computing, conceptual modelling, web services, business processes * Systems and tools around description logics: reasoners, software tools for and using description logic reasoning (e.g. ontology editors, database schema design, query optimisation, and data integration tools), implementation and optimisation techniques, benchmarking, evaluation, modelling Submissions =========== Submissions may be of two types: (1) We invite regular papers of up to 11 pages. If the authors prefer the paper to not appear in the proceedings, an additional 2-page abstract of the paper has to be submitted (the 2-page abstract would appear in the proceedings, in case of acceptance). (2) Papers accepted or under review at some other conference can be submitted to the DL workshop. They should be submitted together with a 2-page abstract that also specifies where the paper has been accepted or is under review. Only the 2-page abstract would appear in the proceedings, in case of acceptance. * The regular papers and 2-page abstracts must be formatted using the Springer LNCS style. The list of references in these submissions does not count towards the page limit. * The option to publish a 2-page abstract is designed for authors who wish to announce results that have been published elsewhere, or which the authors intend to submit or have already submitted to a venue with an incompatible prior / concurrent publication policy. * All submissions may optionally include a clearly marked appendix (e.g., with additional proofs or evaluation data). The appendix will be read at the discretion of the reviewers and not included in the proceedings. The appendix does not need to be in LNCS format. * Accepted regular papers and 2-page abstracts will be made available electronically in the CEUR Workshop Proceedings series (http://www.CEUR-ws.org/). * Accepted submissions, be they regular papers or 2-page abstracts, will be selected for either oral or poster presentation at the workshop. Submissions will be judged solely based upon their content, and the type of submission will have no bearing on the decision between oral and poster presentation. Submission page: https://easychair.org/conferences/?conf=dl2019 Organization ============ * Martin Giese, University of Oslo, Norway (general co-chair) * Mantas Simkus, TU Wien, Austria (program co-chair) * Arild Waaler, University of Oslo, Norway (general co-chair) * Grant Weddell, University of Waterloo, Canada (program co-chair) Resources ========= * Information about submission, registration, travel information, etc., will be available on the DL 2019 homepage: http://dl.kr.org/dl2019/ * The official description logic homepage is at http://dl.kr.org/

5 years, 10 months

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory December 2018