default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th CILC 2023: Udine, Italy
- Agostino Dovier, Andrea Formisano:
Proceedings of the 38th Italian Conference on Computational Logic, Udine, Italy, June 21-23, 2023. CEUR Workshop Proceedings 3428, CEUR-WS.org 2023
Regular Papers
- Mario Alviano, Laura Giordano, Daniele Theseider Dupré:
Preferential Temporal Description Logics with Typicality and Weighted Knowledge Bases. - Mario Alviano, Ly Ly T. Trieu, Tran Cao Son, Marcello Balduccini:
Advancements in xASP, an XAI System for Answer Set Programming. - Alessandro Bertagnon, Marco Gavanelli, Fabio Zanotti:
ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex. - Stefano Bistarelli, Victor David, Francesco Santini, Carlo Taticchi:
Temporal Probabilistic Argumentation Frameworks. - Domenico Cantone, Luca Cuzziol, Eugenio G. Omodeo:
A Brief History of Singlefold Diophantine Definitions. - Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti:
Continued Hereditarily Finite Sets Approximations. - Simone Caruso, Carmine Dodaro, Giuseppe Galatà, Marco Maratea:
Scheduling Periodic Treatments Via Answer Set Programming. - Alberto Casagrande
, Alessandro Cimatti, Luca Dorigo, Carla Piazza, Stefano Tonetta:
Set-Based Invariants over Polynomial Systems. - Stefania Costantini, Andrea Formisano:
Fast Prototyping of a Solver for Reduct-based ELP Semantics. - Stefania Costantini, Andrea Formisano, Valentina Pitoni:
Preference Management in Epistemic Logic L-DINF. - Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca:
Compilation-based Techniques for Evaluating Normal Logic Programs Under the Well-founded Semantics. - Alessandro Dal Palù, Agostino Dovier, Andrea Formisano:
Towards Explainable Data-to-text Generation. - Alex Della Schiava, Carla Piazza, Riccardo Romanello:
Graph-Theoretical Arguments in Support of a Quantum Declarative Manifesto. - Talissa Dreossi:
Exploring ILASP Through Logic Puzzles Modelling. - Camillo Fiorentini, Mauro Ferrari:
A New Approach to Clausification for Intuitionistic Propositional Logic. - Valentina Gliozzi, Gian Luca Pozzato, Alberto Valese:
Proof Methods and Theorem Proving for Conditional Logics with Strong Centering. - Laura Pandolfo, Luca Pulina:
Unlocking Historical Insights: Developing a Dataset from Historical Archives. - Carla Piazza, Riccardo Romanello, Robert Wille:
An ASP Approach for the Synthesis of CNOT Minimal Quantum Circuits. - Marco Scanu, Marco Mochi, Carmine Dodaro, Giuseppe Galatà, Marco Maratea:
Operating Room Scheduling Via Answer Set Programming: The Case of ASL1 Liguria.
Short Papers
- Denise Angilica, Stefano Germano, Giovambattista Ianni:
Domain-agnostic Procedural Content Generation Can Be Done Declaratively. - Francesco Di Cosmo:
Verification of Prev-Free Communicating Datalog Programs. - Gabriele Sacco, Loris Bozzato, Oliver Kutz:
Introducing Weighted Prototypes in Description Logics for Defeasible Reasoning. - Daniele Theseider Dupré:
Explainable Answer Set Programming for Legal Decision Support.
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.
last updated on 2025-05-15 21:30 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:
