Typology
operator:
and / or
Language
operator:
and / or
Date
operator:
and / or
Rights
operator:
and / or
2026
Journal article
Open Access
Belief change based on knowledge measures
Casini Giovanni, Straccia Umberto
Belief Change (BC) is the process of changing beliefs (in our case, in terms of contraction, expansion and revision) taking into account a new piece of knowledge, which possibly may be in contradiction with the current belief. In this work, we present a novel quantitative BC framework based on the principle of minimizing the surprise from an information-theoretic perspective. Central to our approach is the Principle of Minimal Surprise (PMS), which asserts that when confronted with the uncertainty about which is the actual world, an agent should tend to favour the most expected, i.e., least surprising, outcomes. To formalize this, we make use of Knowledge Measures (KMs), which quantify the amount of information contained in a knowledge base. Guided by the PMS, our framework encourages belief change operations that minimize the informational amount deviation from the original belief, i.e., those that introduce the least surprise.Source: JOURNAL OF LOGIC AND COMPUTATION, vol. 36 (issue 2)
DOI: 10.1093/logcom/exag007
Project(s): STARWARS
Metrics:
Casini Giovanni, Straccia Umberto
Belief Change (BC) is the process of changing beliefs (in our case, in terms of contraction, expansion and revision) taking into account a new piece of knowledge, which possibly may be in contradiction with the current belief. In this work, we present a novel quantitative BC framework based on the principle of minimizing the surprise from an information-theoretic perspective. Central to our approach is the Principle of Minimal Surprise (PMS), which asserts that when confronted with the uncertainty about which is the actual world, an agent should tend to favour the most expected, i.e., least surprising, outcomes. To formalize this, we make use of Knowledge Measures (KMs), which quantify the amount of information contained in a knowledge base. Guided by the PMS, our framework encourages belief change operations that minimize the informational amount deviation from the original belief, i.e., those that introduce the least surprise.Source: JOURNAL OF LOGIC AND COMPUTATION, vol. 36 (issue 2)
DOI: 10.1093/logcom/exag007
Project(s): STARWARS
Metrics:
See at:
academic.oup.com 
| CNR IRIS | CNR IRIS 
2026
Book
Open Access
Preface to 19th European Conference on Logics in Artificial Intelligence, JELIA 2025
Casini Giovanni, Dundua Besik, Kutsia Temur
These two volumes contain the proceedings of the 19th European Conference on Logics in Artificial Intelligence (JELIA 2025), held at Kutaisi International University, Kutaisi, Georgia from September 1 to 4, 2025.Source: LECTURE NOTES IN COMPUTER SCIENCE, vol. 16094
Casini Giovanni, Dundua Besik, Kutsia Temur
These two volumes contain the proceedings of the 19th European Conference on Logics in Artificial Intelligence (JELIA 2025), held at Kutaisi International University, Kutaisi, Georgia from September 1 to 4, 2025.Source: LECTURE NOTES IN COMPUTER SCIENCE, vol. 16094
See at:
CNR IRIS | link.springer.com | CNR IRIS
2025
Other
Open Access
ISTI-day 2025 Proceedings
Del Corso G., Pedrotti A., Federico G., Gennaro C., Carrara F., Amato G., Di Benedetto M., Gabrielli E., Belli D., Matrullo Zoe, Miori V., Tolomei Gabriele, Waheed T., Marchetti E., Calabrò Antonello., Rossetti G., Stella Massimo, Cazabet Rémy, Abramski K., Cau E., Citraro S., Failla A., Mesina V., Morini V., Pansanella V., Colantonio S., Germanese D., Pascali M. A., Bianchi L., Messina N., Falchi F., Barsellotti L., Pacini G., Cassese M., Puccetti G., Esuli A., Volpi L., Moreo Alejandro, Sebastiani F., Sperduti G., Nguyen Dong, Broccia G., Ter Beek M. H., Ferrari A., Massink M., Belmonte Gina, Ciancia V., Papini O., Canapa G., Catricalà B., Manca M., Paternò F., Santoro C., Zedda E., Gallo S., Maenza S., Mattioli A., Simeoli L., Rucci D., Carlini E., Dazzi P., Kavalionak H., Mordacchini M., Rulli C., Muntean Cristina Ioana, Nardini F. M., Perego R., Rocchietti G., Lettich F., Renso C., Pugliese C., Casini G., Haldimann Jonas, Meyer Thomas, Assante M., Candela L., Dell'Amico A., Frosini L., Mangiacrapa F., Oliviero A., Pagano P., Panichi G., Peccerillo B., Procaccini M., Mannocci A., Manghi P., Lonetti F., Kang Dongjae, Di Giandomenico F., Jee Eunkyoung, Lazzini G., Conti F., Scopigno R., D'Acunto M., Moroni D., Cafiso M., Paradisi P., Callieri M., Pavoni G., Corsini M., De Falco A., Sala F., Saraceni Q., Gattiglia Gabriele
ISTI-Day is an annual information and networking event organized by the Institute of Information Science and Technologies "A. Faedo" (ISTI) of the Italian National Research Council (CNR). This event features an opening talk of the Director of the Dept. DIITET (Emilio F. Campana) as well as an overview of the Institute's activities presented by the ISTI Director (Roberto Scopigno). Those institutional segments are complemented by dedicated presentations and round tables featuring former staff members, as well as internal and external collaborators. To foster a network of knowledge and collaboration among newcomers, the 2025 ISTI Day edition also includes a large poster session that provides a comprehensive overview of current research activities. Each of the 13 laboratories contributes 1–3 posters, highlighting the most innovative work and offering early-career researchers a platform for discussion. Thus these proceedings include the posters selected for ISTI-Day 2025, reflecting the diverse and innovative nature of the Institute's research.
Del Corso G., Pedrotti A., Federico G., Gennaro C., Carrara F., Amato G., Di Benedetto M., Gabrielli E., Belli D., Matrullo Zoe, Miori V., Tolomei Gabriele, Waheed T., Marchetti E., Calabrò Antonello., Rossetti G., Stella Massimo, Cazabet Rémy, Abramski K., Cau E., Citraro S., Failla A., Mesina V., Morini V., Pansanella V., Colantonio S., Germanese D., Pascali M. A., Bianchi L., Messina N., Falchi F., Barsellotti L., Pacini G., Cassese M., Puccetti G., Esuli A., Volpi L., Moreo Alejandro, Sebastiani F., Sperduti G., Nguyen Dong, Broccia G., Ter Beek M. H., Ferrari A., Massink M., Belmonte Gina, Ciancia V., Papini O., Canapa G., Catricalà B., Manca M., Paternò F., Santoro C., Zedda E., Gallo S., Maenza S., Mattioli A., Simeoli L., Rucci D., Carlini E., Dazzi P., Kavalionak H., Mordacchini M., Rulli C., Muntean Cristina Ioana, Nardini F. M., Perego R., Rocchietti G., Lettich F., Renso C., Pugliese C., Casini G., Haldimann Jonas, Meyer Thomas, Assante M., Candela L., Dell'Amico A., Frosini L., Mangiacrapa F., Oliviero A., Pagano P., Panichi G., Peccerillo B., Procaccini M., Mannocci A., Manghi P., Lonetti F., Kang Dongjae, Di Giandomenico F., Jee Eunkyoung, Lazzini G., Conti F., Scopigno R., D'Acunto M., Moroni D., Cafiso M., Paradisi P., Callieri M., Pavoni G., Corsini M., De Falco A., Sala F., Saraceni Q., Gattiglia Gabriele
ISTI-Day is an annual information and networking event organized by the Institute of Information Science and Technologies "A. Faedo" (ISTI) of the Italian National Research Council (CNR). This event features an opening talk of the Director of the Dept. DIITET (Emilio F. Campana) as well as an overview of the Institute's activities presented by the ISTI Director (Roberto Scopigno). Those institutional segments are complemented by dedicated presentations and round tables featuring former staff members, as well as internal and external collaborators. To foster a network of knowledge and collaboration among newcomers, the 2025 ISTI Day edition also includes a large poster session that provides a comprehensive overview of current research activities. Each of the 13 laboratories contributes 1–3 posters, highlighting the most innovative work and offering early-career researchers a platform for discussion. Thus these proceedings include the posters selected for ISTI-Day 2025, reflecting the diverse and innovative nature of the Institute's research.
See at:
CNR IRIS | www.isti.cnr.it | CNR IRIS
2025
Other
Restricted
InfraScience research activity report 2024
Angioni S., Artini M., Assante M., Atzori C., Baglioni M., Bardi A., Bosio C., Bove P., Calanducci A., Candela L., Casini G., Castelli D., Cirillo R., Coro G., De Bonis M., Debole F., Dell'Amico A., Frosini L., Ibrahim Ahmed, La Bruzzo S., Lelii L., Manghi P., Mangiacrapa F., Mangione D., Mannocci A., Molinaro E., Oliviero A., Pagano P., Panichi G., Teresa M. T., Pavone G., Peccerillo B., Piccioli T., Procaccini M., Straccia U., Vannini G. L., Versienti L.
InfraScience is a research group within the Institute of Information Science and Technologies (ISTI) of the National Research Council of Italy (CNR), based in Pisa. This activity report outlines the group's research achievements and initiatives throughout 2024. InfraScience focused its efforts on key challenges in the areas of Data Infrastructures, e-Science, and Intelligent Systems, maintaining a strong synergy between research and development and a firm commitment to open science principles. In 2024, the group played a leading role in the development and evolution of two major Open Science infrastructures: D4Science and OpenAIRE. InfraScience researchers contributed significantly to the scientific community through the publication of peer-reviewed papers, active participation in EU-funded research projects, organization of international conferences and training activities, and engagement in various working groups and task forces. This report highlights these contributions and underscores the group's ongoing dedication to advancing open, collaborative, and impactful science.DOI: 10.32079/isti-ar-2025/001
Metrics:
Angioni S., Artini M., Assante M., Atzori C., Baglioni M., Bardi A., Bosio C., Bove P., Calanducci A., Candela L., Casini G., Castelli D., Cirillo R., Coro G., De Bonis M., Debole F., Dell'Amico A., Frosini L., Ibrahim Ahmed, La Bruzzo S., Lelii L., Manghi P., Mangiacrapa F., Mangione D., Mannocci A., Molinaro E., Oliviero A., Pagano P., Panichi G., Teresa M. T., Pavone G., Peccerillo B., Piccioli T., Procaccini M., Straccia U., Vannini G. L., Versienti L.
InfraScience is a research group within the Institute of Information Science and Technologies (ISTI) of the National Research Council of Italy (CNR), based in Pisa. This activity report outlines the group's research achievements and initiatives throughout 2024. InfraScience focused its efforts on key challenges in the areas of Data Infrastructures, e-Science, and Intelligent Systems, maintaining a strong synergy between research and development and a firm commitment to open science principles. In 2024, the group played a leading role in the development and evolution of two major Open Science infrastructures: D4Science and OpenAIRE. InfraScience researchers contributed significantly to the scientific community through the publication of peer-reviewed papers, active participation in EU-funded research projects, organization of international conferences and training activities, and engagement in various working groups and task forces. This report highlights these contributions and underscores the group's ongoing dedication to advancing open, collaborative, and impactful science.DOI: 10.32079/isti-ar-2025/001
Metrics:
2025
Conference article
Open Access
Semantic bridges between first order c-representations and cost-based semantics: an initial perspective
Leisegang N., Casini G., Meyer T.
Weighted-knowledge bases and cost-based semantics represent a recent formalism introduced by Bienvenu et al. for Ontology Mediated Data Querying in the case where a given knowledge base is inconsistent. This is done by adding a weight to each statement in the knowledge base (KB), and then giving each DL interpretation a cost based on how often it breaks rules in the KB. In this paper we compare this approach with c-representations, a form of non-monotonic reasoning originally introduced by Kern-Isberner. c-Representations describe a means to interpret defeasible concept inclusions of the form C ⊏∼ D (read “instances of C are usually instances of D”) in the first-order case. This is done by assigning a numerical ranking to each interpretations via penalties for each violated conditional. We compare these two approaches on a semantic level. In particular, we show that under certain conditions a weighted knowledge base and a set of defeasible conditionals can generate the same ordering on interpretations, and therefore an equivalence of semantic structures up to relative cost. Moreover, we compare entailment described in both cases, where certain notions are equivalently expressible in both formalisms. Our results have the potential to benefit further work on both cost-based semantics and c-representations.Source: CEUR WORKSHOP PROCEEDINGS, vol. 4071, pp. 210-224. Melbourne, Australia, 11-13 November 2025
Project(s): STARWARS
Leisegang N., Casini G., Meyer T.
Weighted-knowledge bases and cost-based semantics represent a recent formalism introduced by Bienvenu et al. for Ontology Mediated Data Querying in the case where a given knowledge base is inconsistent. This is done by adding a weight to each statement in the knowledge base (KB), and then giving each DL interpretation a cost based on how often it breaks rules in the KB. In this paper we compare this approach with c-representations, a form of non-monotonic reasoning originally introduced by Kern-Isberner. c-Representations describe a means to interpret defeasible concept inclusions of the form C ⊏∼ D (read “instances of C are usually instances of D”) in the first-order case. This is done by assigning a numerical ranking to each interpretations via penalties for each violated conditional. We compare these two approaches on a semantic level. In particular, we show that under certain conditions a weighted knowledge base and a set of defeasible conditionals can generate the same ordering on interpretations, and therefore an equivalence of semantic structures up to relative cost. Moreover, we compare entailment described in both cases, where certain notions are equivalently expressible in both formalisms. Our results have the potential to benefit further work on both cost-based semantics and c-representations.Source: CEUR WORKSHOP PROCEEDINGS, vol. 4071, pp. 210-224. Melbourne, Australia, 11-13 November 2025
Project(s): STARWARS
See at:
ceur-ws.org | CNR IRIS | CNR IRIS
2025
Conference article
Open Access
Reasoning in defeasible description logics with System W and lexicographic inference
Casini G., Haldimann J., Meyer T.
Description Logics (DLs) are widely applied in AI and database systems. However, like other classical logics, they cannot adequately handle defeasible information. Building on the notion of rational closure - a form of defeasible reasoning originally developed for the propositional setting and later adapted to DLs - we extend this approach by incorporating two further forms of defeasible reasoning: System W and lexicographic closure. Both are well-established entailment relations in the propositional case and are known to satisfy several desirable properties. In this paper, we provide model-theoretic definitions of these extensions for DLs, analyze their behaviour by relating them to their propositional counterparts, and present algorithms for their computation.Source: PROCEEDINGS INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, pp. 218-228. Melbourne, Australia, 11-17/11/2025
DOI: 10.24963/kr.2025/22
Project(s): STormwAteR and WastewAteR networkS heterogeneous data AI-driven management
Metrics:
Casini G., Haldimann J., Meyer T.
Description Logics (DLs) are widely applied in AI and database systems. However, like other classical logics, they cannot adequately handle defeasible information. Building on the notion of rational closure - a form of defeasible reasoning originally developed for the propositional setting and later adapted to DLs - we extend this approach by incorporating two further forms of defeasible reasoning: System W and lexicographic closure. Both are well-established entailment relations in the propositional case and are known to satisfy several desirable properties. In this paper, we provide model-theoretic definitions of these extensions for DLs, analyze their behaviour by relating them to their propositional counterparts, and present algorithms for their computation.Source: PROCEEDINGS INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, pp. 218-228. Melbourne, Australia, 11-17/11/2025
DOI: 10.24963/kr.2025/22
Project(s): STormwAteR and WastewAteR networkS heterogeneous data AI-driven management
Metrics:
See at:
CNR IRIS | proceedings.kr.org | doi.org | CNR IRIS
2024
Conference article
Open Access
Defeasible justification for KLM-style logic
Chama V., Wang S., Meyer T., Casini G.
Research in description logics (DLs) and formal ontologies has dedicated quite an effort to the investigation of the notion of explanation for DL reasoning, for example relying on the notion of justification [1]. There has also been some effort dedicated to the definition of defeasible reasoning for DLs that, contrary to the classical monotonic reasoning, is appropriate for dealing with incomplete/uncertain information. In the present paper, we extend the notion of justification to the framework of defeasible reasoning for DLs; specifically, we consider rational closure [2], an entailment relation that is of particular importance in the area of defeasible reasoning. Here we present the main theoretical results for the DL ALC, and an implementation of our solution, at the moment developed for propositional logic.Source: CEUR WORKSHOP PROCEEDINGS, vol. 3739. Bergen, Norway, 18-21/06/2024
Project(s): STARWARS
Chama V., Wang S., Meyer T., Casini G.
Research in description logics (DLs) and formal ontologies has dedicated quite an effort to the investigation of the notion of explanation for DL reasoning, for example relying on the notion of justification [1]. There has also been some effort dedicated to the definition of defeasible reasoning for DLs that, contrary to the classical monotonic reasoning, is appropriate for dealing with incomplete/uncertain information. In the present paper, we extend the notion of justification to the framework of defeasible reasoning for DLs; specifically, we consider rational closure [2], an entailment relation that is of particular importance in the area of defeasible reasoning. Here we present the main theoretical results for the DL ALC, and an implementation of our solution, at the moment developed for propositional logic.Source: CEUR WORKSHOP PROCEEDINGS, vol. 3739. Bergen, Norway, 18-21/06/2024
Project(s): STARWARS
See at:
ceur-ws.org | CNR IRIS | CNR IRIS
2023
Journal article
Open Access
Situated conditional reasoning
Casini G, Meyer T, Varzinczak I
Conditionals are useful for modelling many forms of everyday human reasoning but are not always sufficiently expressive to represent the information we want to reason about. In this paper, we make a case for a form of situated conditional. By 'situated', we mean that there is a context, based on an agent's beliefs and expectations, that works as background information in evaluating a conditional, and we allow such a context to vary. These conditionals are able to distinguish, for example, between expectations and counterfactuals. Formally, they are shown to generalise the conditional setting in the style of Kraus, Lehmann, and Magidor. We show that situated conditionals can be described in terms of a set of rationality postulates. We then propose an intuitive semantics for these conditionals and present a representation result which shows that our semantic construction corresponds exactly to the description in terms of postulates. With the semantics in place, we define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure. Finally, we proceed to show that it is possible to reduce the computation of minimal closure to a series of propositional entailment and satisfiability checks. While this is also the case for rational closure, it is somewhat surprising that the result carries over to minimal closure.Source: ARTIFICIAL INTELLIGENCE, vol. 319
DOI: 10.1016/j.artint.2023.103917
DOI: 10.48550/arxiv.2109.01552
Project(s): TAILOR
Metrics:
Casini G, Meyer T, Varzinczak I
Conditionals are useful for modelling many forms of everyday human reasoning but are not always sufficiently expressive to represent the information we want to reason about. In this paper, we make a case for a form of situated conditional. By 'situated', we mean that there is a context, based on an agent's beliefs and expectations, that works as background information in evaluating a conditional, and we allow such a context to vary. These conditionals are able to distinguish, for example, between expectations and counterfactuals. Formally, they are shown to generalise the conditional setting in the style of Kraus, Lehmann, and Magidor. We show that situated conditionals can be described in terms of a set of rationality postulates. We then propose an intuitive semantics for these conditionals and present a representation result which shows that our semantic construction corresponds exactly to the description in terms of postulates. With the semantics in place, we define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure. Finally, we proceed to show that it is possible to reduce the computation of minimal closure to a series of propositional entailment and satisfiability checks. While this is also the case for rational closure, it is somewhat surprising that the result carries over to minimal closure.Source: ARTIFICIAL INTELLIGENCE, vol. 319
DOI: 10.1016/j.artint.2023.103917
DOI: 10.48550/arxiv.2109.01552
Project(s): TAILOR
Metrics:
See at:
arXiv.org e-Print Archive | CNR IRIS | ISTI Repository | www.sciencedirect.com | Artificial Intelligence | doi.org | CNR IRIS | CNR IRIS
2023
Journal article
Open Access
Defeasible RDFS via rational closure
Casini G, Straccia U
In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a notable approach. In recent years, RC has gained popularity in the context of Description Logics (DLs), the logic underpinning the standard semantic Web Ontology Language OWL 2, whose main ingredients are classes, the relationship among classes and roles, which are used to describe the properties of classes.In this work, we show instead how to integrate RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL 2 is a major standard semantic web ontology language.To do so, we start from rdf, a minimal, but significant RDFS fragment that covers the essential features of RDFS, and then extend it to rdf_\bot, allowing to state that two entities are incompatible/disjoint with each other. Eventually, we propose defeasible rdf_\bot via a typical RC construction allowing to state default class/property inclusions.Furthermore, to overcome the main weaknesses of RC in our context, i.e., the "drowning problem" (viz. the "inheritance blocking problem"), we further extend our construction by leveraging Defeasible Inheritance Networks (DIN) defining a new non-monotonic inference relation that combines the advantages of both (RC and DIN). To the best of our knowledge this is the first time of such an attempt.In summary, the main features of our approach are: (i) the defeasible rdf_\bot we propose here remains syntactically a triple language by extending it with new predicate symbols with specific semantics; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra non-monotonic capabilities; (iii) the defeasible entailment decision procedure is built on top of the rdf_\bot entailment decision procedure, which in turn is an extension of the one for rdf via some additional inference rules favouring a potential implementation; (iv) the computational complexity of deciding entailment in rdf and rdf_\bot are the same; and (v) defeasible entailment can be decided via a polynomial number of calls to an oracle deciding ground triple entailment in rdf_\bot and, in particular, deciding defeasible entailment can be done in polynomial time.Source: INFORMATION SCIENCES, vol. 643
DOI: 10.1016/j.ins.2022.11.165
DOI: 10.48550/arxiv.2007.07573
Project(s): TAILOR
Metrics:
Casini G, Straccia U
In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a notable approach. In recent years, RC has gained popularity in the context of Description Logics (DLs), the logic underpinning the standard semantic Web Ontology Language OWL 2, whose main ingredients are classes, the relationship among classes and roles, which are used to describe the properties of classes.In this work, we show instead how to integrate RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL 2 is a major standard semantic web ontology language.To do so, we start from rdf, a minimal, but significant RDFS fragment that covers the essential features of RDFS, and then extend it to rdf_\bot, allowing to state that two entities are incompatible/disjoint with each other. Eventually, we propose defeasible rdf_\bot via a typical RC construction allowing to state default class/property inclusions.Furthermore, to overcome the main weaknesses of RC in our context, i.e., the "drowning problem" (viz. the "inheritance blocking problem"), we further extend our construction by leveraging Defeasible Inheritance Networks (DIN) defining a new non-monotonic inference relation that combines the advantages of both (RC and DIN). To the best of our knowledge this is the first time of such an attempt.In summary, the main features of our approach are: (i) the defeasible rdf_\bot we propose here remains syntactically a triple language by extending it with new predicate symbols with specific semantics; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra non-monotonic capabilities; (iii) the defeasible entailment decision procedure is built on top of the rdf_\bot entailment decision procedure, which in turn is an extension of the one for rdf via some additional inference rules favouring a potential implementation; (iv) the computational complexity of deciding entailment in rdf and rdf_\bot are the same; and (v) defeasible entailment can be decided via a polynomial number of calls to an oracle deciding ground triple entailment in rdf_\bot and, in particular, deciding defeasible entailment can be done in polynomial time.Source: INFORMATION SCIENCES, vol. 643
DOI: 10.1016/j.ins.2022.11.165
DOI: 10.48550/arxiv.2007.07573
Project(s): TAILOR
Metrics:
See at:
arXiv.org e-Print Archive | CNR IRIS | www.sciencedirect.com | Information Sciences | doi.org | CNR IRIS | CNR IRIS
2023
Conference article
Open Access
Revising typical beliefs: one revision to rule them all
Heyninck J, Casini G, Meyer T, Straccia U
Propositional Typicality Logic (PTL) extends propositional logic with a connective $\bullet$ expressing the most typical (alias normal or conventional) situations in which a given sentence holds. As such, it generalises e.g. preferential logics that formalise reasoning with conditionals such as "birds typically fly". In this paper we study the revision of sets of PTL sentences. We first show why it is necessary to extend the PTL language with a possibility operator and then define the revision of PTL sentences syntactically and characterise it semantically. We show that this allows us to represent a wide variety of existing revision methods, such as propositional revision and revision of epistemic states. Furthermore, we provide several examples showing why our approach is innovative. In more detail, we study the revision of a set of conditionals under preferential closure and the addition and contraction of possible worlds from an epistemic state.DOI: 10.24963/kr.2023/35
Project(s): TAILOR
Metrics:
Heyninck J, Casini G, Meyer T, Straccia U
Propositional Typicality Logic (PTL) extends propositional logic with a connective $\bullet$ expressing the most typical (alias normal or conventional) situations in which a given sentence holds. As such, it generalises e.g. preferential logics that formalise reasoning with conditionals such as "birds typically fly". In this paper we study the revision of sets of PTL sentences. We first show why it is necessary to extend the PTL language with a possibility operator and then define the revision of PTL sentences syntactically and characterise it semantically. We show that this allows us to represent a wide variety of existing revision methods, such as propositional revision and revision of epistemic states. Furthermore, we provide several examples showing why our approach is innovative. In more detail, we study the revision of a set of conditionals under preferential closure and the addition and contraction of possible worlds from an epistemic state.DOI: 10.24963/kr.2023/35
Project(s): TAILOR
Metrics:
See at:
CNR IRIS | ISTI Repository | proceedings.kr.org | CNR IRIS
2023
Other
Open Access
InfraScience research activity report 2023
Artini M., Assante M., Atzori C., Baglioni M., Bardi A., Bosio C., Bove P., Calanducci A., Candela L., Casini G., Castelli D., Cirillo R., Coro G., De Bonis M., Debole F., Dell'Amico A., Frosini L., Ibrahim A. S. T., La Bruzzo S., Lelii L., Manghi P., Mangiacrapa F., Mangione D., Mannocci A., Molinaro E., Pagano P., Panichi G., Paratore M. T., Pavone G., Piccioli T., Sinibaldi F., Straccia U., Vannini G. L.
InfraScience is a research group of the National Research Council of Italy - Institute of Information Science and Technologies (CNR - ISTI) based in Pisa, Italy. This report documents the research activity performed by this group in 2023 to highlight the major results. In particular, the InfraScience group engaged in research challenges characterising Data Infrastructures, e-Science, and Intelligent Systems. The group activity is pursued by closely connecting research and development and by promoting and supporting open science. In fact, the group is leading the development of two large scale infrastructures for Open Science, i.e. D4Science and OpenAIRE. During 2023 InfraScience members contributed to the publishing of several papers, to the research and development activities of several research projects (primarily funded by EU), to the organization of conferences and training events, to several working groups and task forces.DOI: 10.32079/isti-ar-2023/002
Project(s): Blue Cloud, EOSC Future , TAILOR
Metrics:
Artini M., Assante M., Atzori C., Baglioni M., Bardi A., Bosio C., Bove P., Calanducci A., Candela L., Casini G., Castelli D., Cirillo R., Coro G., De Bonis M., Debole F., Dell'Amico A., Frosini L., Ibrahim A. S. T., La Bruzzo S., Lelii L., Manghi P., Mangiacrapa F., Mangione D., Mannocci A., Molinaro E., Pagano P., Panichi G., Paratore M. T., Pavone G., Piccioli T., Sinibaldi F., Straccia U., Vannini G. L.
InfraScience is a research group of the National Research Council of Italy - Institute of Information Science and Technologies (CNR - ISTI) based in Pisa, Italy. This report documents the research activity performed by this group in 2023 to highlight the major results. In particular, the InfraScience group engaged in research challenges characterising Data Infrastructures, e-Science, and Intelligent Systems. The group activity is pursued by closely connecting research and development and by promoting and supporting open science. In fact, the group is leading the development of two large scale infrastructures for Open Science, i.e. D4Science and OpenAIRE. During 2023 InfraScience members contributed to the publishing of several papers, to the research and development activities of several research projects (primarily funded by EU), to the organization of conferences and training events, to several working groups and task forces.DOI: 10.32079/isti-ar-2023/002
Project(s): Blue Cloud
, EOSC Future , TAILOR Metrics:
2023
Book
Open Access
Preface for the first Workshop on AI-driven heterogeneous data management: Completing, merging, handling inconsistencies and query-answering (ENIGMA-2023)
Benferhat S, Casini G, Meyer T, Tettamanzi Agb
Proceedings of 1st Workshop on AI-driven heterogeneous data management: Completing, merging, handling inconsistencies and query-answering, co-located with 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023).Source: CEUR WORKSHOP PROCEEDINGS, pp. 1-95
Benferhat S, Casini G, Meyer T, Tettamanzi Agb
Proceedings of 1st Workshop on AI-driven heterogeneous data management: Completing, merging, handling inconsistencies and query-answering, co-located with 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023).Source: CEUR WORKSHOP PROCEEDINGS, pp. 1-95
See at:
ceur-ws.org | CNR IRIS | ISTI Repository | CNR IRIS
2022
Conference article
Open Access
A rational entailment for expressive description logics via description logic programs
Casini G, Straccia U
Lehmann and Magidor's rational closure is acknowledged as a land-mark in the field of non-monotonic logics and it has also been re-formulated in the context ofDescription Logics (DLs). We show here how to model a rational form of entailment for expressive DLs, such as SROIQ, providing a novel reasoning procedure that compiles a non-monotone DL knowledge base into a description logic program(dl-program).Source: COMMUNICATIONS IN COMPUTER AND INFORMATION SCIENCE (PRINT), pp. 177-191. Durban, South Africa, 6-10/12/2021
DOI: 10.1007/978-3-030-95070-5_12
Metrics:
Casini G, Straccia U
Lehmann and Magidor's rational closure is acknowledged as a land-mark in the field of non-monotonic logics and it has also been re-formulated in the context ofDescription Logics (DLs). We show here how to model a rational form of entailment for expressive DLs, such as SROIQ, providing a novel reasoning procedure that compiles a non-monotone DL knowledge base into a description logic program(dl-program).Source: COMMUNICATIONS IN COMPUTER AND INFORMATION SCIENCE (PRINT), pp. 177-191. Durban, South Africa, 6-10/12/2021
DOI: 10.1007/978-3-030-95070-5_12
Metrics:
See at:
CNR IRIS | link.springer.com | ISTI Repository | CNR IRIS | CNR IRIS
2022
Other
Open Access
A general framework for modelling conditional reasoning - Preliminary report
Casini G, Straccia U
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we propose is appropriate for a structural analysis of those conditionals that do not satisfy closure properties associated to classical logics.Project(s): TAILOR
Casini G, Straccia U
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we propose is appropriate for a structural analysis of those conditionals that do not satisfy closure properties associated to classical logics.Project(s): TAILOR
See at:
arxiv.org | CNR IRIS | ISTI Repository | CNR IRIS
2022
Other
Open Access
A minimal deductive system for RDFS with negative statements
Straccia U, Casini G
The triple language RDFS is designed to represent and reason with \emph{positive} statements only (e.g."antipyretics are drugs"). In this paper we show how to extend RDFS to express and reason with various forms of negative statements under the Open World Assumption (OWA). To do so, we start from rdf, a minimal, but significant RDFS fragment that covers all essential features of RDFS, and then extend it to ?rdfbotneg, allowing express also statements such as "radio therapies are non drug treatments", "Ebola has no treatment", or "opioids and antipyretics are disjoint classes". The main and, to the best of our knowledge, unique features of our proposal are: (i) rdfbotneg remains syntactically a triple language by extending rdf with new symbols with specific semantics and there is no need to revert to the reification method to represent negative triples; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra capabilities; (iii) despite negated statements, every rdfbotneg knowledge base is satisfiable; (iv) the rdfbotneg entailment decision procedure is obtained from rdf via additional inference rules favouring a potential implementation; and (v) deciding entailment in rdfbotneg ranges from P to NP.Project(s): TAILOR
Straccia U, Casini G
The triple language RDFS is designed to represent and reason with \emph{positive} statements only (e.g."antipyretics are drugs"). In this paper we show how to extend RDFS to express and reason with various forms of negative statements under the Open World Assumption (OWA). To do so, we start from rdf, a minimal, but significant RDFS fragment that covers all essential features of RDFS, and then extend it to ?rdfbotneg, allowing express also statements such as "radio therapies are non drug treatments", "Ebola has no treatment", or "opioids and antipyretics are disjoint classes". The main and, to the best of our knowledge, unique features of our proposal are: (i) rdfbotneg remains syntactically a triple language by extending rdf with new symbols with specific semantics and there is no need to revert to the reification method to represent negative triples; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra capabilities; (iii) despite negated statements, every rdfbotneg knowledge base is satisfiable; (iv) the rdfbotneg entailment decision procedure is obtained from rdf via additional inference rules favouring a potential implementation; and (v) deciding entailment in rdfbotneg ranges from P to NP.Project(s): TAILOR
See at:
arxiv.org | CNR IRIS | ISTI Repository | CNR IRIS
2022
Conference article
Open Access
A general framework for modelling conditional reasoning - Preliminary report
Casini G, Straccia U
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we propose is appropriate for a structural analysis of those conditionals that do not satisfy closure properties associated to classical logics.DOI: 10.24963/kr.2022/12
DOI: 10.48550/arxiv.2202.07596
Project(s): TAILOR
Metrics:
Casini G, Straccia U
We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we propose is appropriate for a structural analysis of those conditionals that do not satisfy closure properties associated to classical logics.DOI: 10.24963/kr.2022/12
DOI: 10.48550/arxiv.2202.07596
Project(s): TAILOR
Metrics:
See at:
arXiv.org e-Print Archive | CNR IRIS | ISTI Repository | proceedings.kr.org | doi.org | doi.org | CNR IRIS
2022
Conference article
Open Access
A minimal deductive system for RDFS with negative statements
Straccia U., Casini G.
The triple language RDFS is designed to represent and reason with \emph{positive} statements only (e.g."antipyretics are drugs"). In this paper we show how to extend RDFS to express and reason with various forms of negative statements under the Open World Assumption (OWA). To do so, we start from rdf, a minimal, but significant RDFS fragment that covers all essential features of RDFS, and then extend it to ?rdfbotneg, allowing express also statements such as "radio therapies are non drug treatments", "Ebola has no treatment", or "opioids and antipyretics are disjoint classes". The main and, to the best of our knowledge, unique features of our proposal are: (i) rdfbotneg remains syntactically a triple language by extending rdf with new symbols with specific semantics and there is no need to revert to the reification method to represent negative triples; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra capabilities; (iii) despite negated statements, every rdfbotneg knowledge base is satisfiable; (iv) the rdfbotneg entailment decision procedure is obtained from rdf via additional inference rules favouring a potential implementation; and (v) deciding entailment in rdfbotneg ranges from P to NP.Source: PROCEEDINGS-INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, pp. 351-361. Haifa, Israel, 31/07-05/08/2022
DOI: 10.24963/kr.2022/35
DOI: 10.48550/arxiv.2202.13750
Project(s): TAILOR
Metrics:
Straccia U., Casini G.
The triple language RDFS is designed to represent and reason with \emph{positive} statements only (e.g."antipyretics are drugs"). In this paper we show how to extend RDFS to express and reason with various forms of negative statements under the Open World Assumption (OWA). To do so, we start from rdf, a minimal, but significant RDFS fragment that covers all essential features of RDFS, and then extend it to ?rdfbotneg, allowing express also statements such as "radio therapies are non drug treatments", "Ebola has no treatment", or "opioids and antipyretics are disjoint classes". The main and, to the best of our knowledge, unique features of our proposal are: (i) rdfbotneg remains syntactically a triple language by extending rdf with new symbols with specific semantics and there is no need to revert to the reification method to represent negative triples; (ii) the logic is defined in such a way that any RDFS reasoner/store may handle the new predicates as ordinary terms if it does not want to take account of the extra capabilities; (iii) despite negated statements, every rdfbotneg knowledge base is satisfiable; (iv) the rdfbotneg entailment decision procedure is obtained from rdf via additional inference rules favouring a potential implementation; and (v) deciding entailment in rdfbotneg ranges from P to NP.Source: PROCEEDINGS-INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, pp. 351-361. Haifa, Israel, 31/07-05/08/2022
DOI: 10.24963/kr.2022/35
DOI: 10.48550/arxiv.2202.13750
Project(s): TAILOR
Metrics:
See at:
arXiv.org e-Print Archive | CNR IRIS | ISTI Repository | proceedings.kr.org | doi.org | doi.org | CNR IRIS
2022
Conference article
Open Access
Situated conditionals - A brief introduction
Casini G, Meyer T, Varzinczak I
We extend the expressivity of classical conditional reasoning by introducing situation as a new parameter. The enriched conditional logic generalises the defeasible conditional setting in the style of Kraus, Lehmann, and Magidor, and allows for a refined semantics that is able to distinguish, for example, between expectations and counterfactuals. We introduce the language for the enriched logic and define an appropriate semantic framework for it. We analyse which properties generally associated with conditional reasoning are still satisfied by the new semantic framework, provide a suitable representation result, and define an entailment relation based on Lehmann and Magidor's generally-accepted notion of RationalClosure.Source: CEUR WORKSHOP PROCEEDINGS, pp. 151-154. Haifa, Israel, 07-09/08/2022
Project(s): TAILOR
Casini G, Meyer T, Varzinczak I
We extend the expressivity of classical conditional reasoning by introducing situation as a new parameter. The enriched conditional logic generalises the defeasible conditional setting in the style of Kraus, Lehmann, and Magidor, and allows for a refined semantics that is able to distinguish, for example, between expectations and counterfactuals. We introduce the language for the enriched logic and define an appropriate semantic framework for it. We analyse which properties generally associated with conditional reasoning are still satisfied by the new semantic framework, provide a suitable representation result, and define an entailment relation based on Lehmann and Magidor's generally-accepted notion of RationalClosure.Source: CEUR WORKSHOP PROCEEDINGS, pp. 151-154. Haifa, Israel, 07-09/08/2022
Project(s): TAILOR
See at:
ceur-ws.org | CNR IRIS | ISTI Repository | CNR IRIS
2022
Conference article
Open Access
Defeasible reasoning in RDFS
Casini G, Straccia U
For non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as one of the main approaches. In this work we present an integration of RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL 2 is a major standard semantic web ontology language. To do so, we start from ?df, an RDFS fragment that covers the essential features of RDFS, and extend it to ?df?, allowing to state that two entities are incompatible/disjoint with each other. Eventually, we propose defeasible ?df? via a typical RC construction allowing to state default class/property inclusions.Source: CEUR WORKSHOP PROCEEDINGS, vol. 3197, pp. 155-158. Haifa, Israel, 07-09/08/2022
Project(s): TAILOR
Casini G, Straccia U
For non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as one of the main approaches. In this work we present an integration of RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL 2 is a major standard semantic web ontology language. To do so, we start from ?df, an RDFS fragment that covers the essential features of RDFS, and extend it to ?df?, allowing to state that two entities are incompatible/disjoint with each other. Eventually, we propose defeasible ?df? via a typical RC construction allowing to state default class/property inclusions.Source: CEUR WORKSHOP PROCEEDINGS, vol. 3197, pp. 155-158. Haifa, Israel, 07-09/08/2022
Project(s): TAILOR
See at:
ceur-ws.org | CNR IRIS | ISTI Repository | CNR IRIS
2022
Book
Open Access
Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (NMR 2022)
Arieli O, Casini G, Giordano L
Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (NMR2022)Source: CEUR WORKSHOP PROCEEDINGS
Arieli O, Casini G, Giordano L
Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (NMR2022)Source: CEUR WORKSHOP PROCEEDINGS
See at:
ceur-ws.org | CNR IRIS | ISTI Repository | CNR IRIS