This document provides an overview of constructive modal logics. It discusses motivation for considering constructive modalities and briefly outlines the history of research at the intersection of constructive and modal logic. The talk then explores several approaches to developing constructive modal, hybrid, and description logics, including translating logics into intuitionistic first-order logic or constructive modal logics like IK or CK. Related work is also mentioned. The discussion emphasizes that more work is needed to establish criteria for identifying the best constructive systems and to apply these logics to areas like temporal reasoning.
Talk at the Melbourne Logic Seminar
on Shawn Standefer invitation
Dialectica categories for the Lambek calculus
Valeria de Paiva
The Topos Institute, Berkeley, CA
Abstract:
Dialectica categorical models of the Lambek Calculus were first presented in the Amsterdam Colloquium a long time ago. Following Lambek's lead, we approached the Lambek Calculus from the perspective of Linear Logic and adapted the Dialectica categorical models for Linear Logic to Lambek's non-commutative calculus. The old work took for granted the syntax of the Lambek calculus and only discussed the exciting possibilities of new models for the modalities that Linear Logic introduced. Many years later we find that the work on dialectica models of the Lambek calculus is still interesting and that it might inform some of the most recent work on the relationship between Categorial Grammars and notions of Distributional Semantics.
Thus we revisited the old work, making sure that the syntax details that were sketchy on the first version got completed and verified, using automated tools such as Agda and Ott. Ultimately we are interested in the applicability of the original systems to their intended uses in the construction of semantics of Natural Language. But before we can discuss it, we need to make sure that the mathematical properties that make the Lambek calculus attractive are all properly modeled and this is the main aim of this paper.
We recall the Lambek calculus with its Curry-Howard isomorphic term assignment system. We extend it with a $\kappa$ modality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality $!$, as Girard did, re-introducing weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present algebraic semantics and categorical semantics, proved sound and complete for the whole system. Finally, we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
Talk at the 1st Joint Meeting Brazil-France in Mathematics, https://impa.br/eventos-do-impa/eventos-2019/1st-joint-meeting-brazil-france-in-mathematics/
Talk at the Melbourne Logic Seminar
on Shawn Standefer invitation
Dialectica categories for the Lambek calculus
Valeria de Paiva
The Topos Institute, Berkeley, CA
Abstract:
Dialectica categorical models of the Lambek Calculus were first presented in the Amsterdam Colloquium a long time ago. Following Lambek's lead, we approached the Lambek Calculus from the perspective of Linear Logic and adapted the Dialectica categorical models for Linear Logic to Lambek's non-commutative calculus. The old work took for granted the syntax of the Lambek calculus and only discussed the exciting possibilities of new models for the modalities that Linear Logic introduced. Many years later we find that the work on dialectica models of the Lambek calculus is still interesting and that it might inform some of the most recent work on the relationship between Categorial Grammars and notions of Distributional Semantics.
Thus we revisited the old work, making sure that the syntax details that were sketchy on the first version got completed and verified, using automated tools such as Agda and Ott. Ultimately we are interested in the applicability of the original systems to their intended uses in the construction of semantics of Natural Language. But before we can discuss it, we need to make sure that the mathematical properties that make the Lambek calculus attractive are all properly modeled and this is the main aim of this paper.
We recall the Lambek calculus with its Curry-Howard isomorphic term assignment system. We extend it with a $\kappa$ modality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality $!$, as Girard did, re-introducing weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present algebraic semantics and categorical semantics, proved sound and complete for the whole system. Finally, we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
Talk at the 1st Joint Meeting Brazil-France in Mathematics, https://impa.br/eventos-do-impa/eventos-2019/1st-joint-meeting-brazil-france-in-mathematics/
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecn...Antonio Lieto
Cognitive Agents with Commonsense - Invited Talk at Istituto Italiano di Tecnologia (IIT), I-Cog Initiative. https://www.facebook.com/icog.initiative/posts/129265685733532
Formal and Computational Representations
The Semantics of First-Order Logic
Event Representations
Description Logics & the Web Ontology Language
Compositionality
Lamba calculus
Corpus-based approaches:
Latent Semantic Analysis
Topic models
Distributional Semantics
Lecture slides by Mustafa Jarrar at Birzeit University, Palestine.
See the course webpage at: http://jarrar-courses.blogspot.com/2011/09/knowledgeengineering-fall2011.html
and http://www.jarrar.info
and on Youtube:
http://www.youtube.com/watch?v=3_-HGnI6AZ0&list=PLDEA50C29F3D28257
Analogy is one of the most studied representatives of a family of non-classical forms of reasoning working across different domains, usually taken to play a crucial role in creative thought and problem-solving. In the first part of the talk, I will shortly introduce general principles of computational analogy models (relying on a generalization-based approach to analogy-making). We will then have a closer look at Heuristic-Driven Theory Projection (HDTP) as an example for a theoretical framework and implemented system: HDTP computes analogical relations and inferences for domains which are represented using many-sorted first-order logic languages, applying a restricted form of higher-order anti-unification for finding shared structural elements common to both domains. The presentation of the framework will be followed by a few reflections on the "cognitive plausibility" of the approach motivated by theoretical complexity and tractability considerations.
In the second part of the talk I will discuss an application of HDTP to modeling essential parts of concept blending processes as current "hot topic" in Cognitive Science. Here, I will sketch an analogy-inspired formal account of concept blending —developed in the European FP7-funded Concept Invention Theory (COINVENT) project— combining HDTP with mechanisms from Case-Based Reasoning.
Different Semantic Perspectives for Question Answering SystemsAndre Freitas
Question Answering systems define one of the most complex tasks in computational semantics. The intrinsic complexity of the QA task allows researchers of QA systems to investigate and explore different perspectives of semantics. However, this complexity also induces a bias towards a systems perspective, where researchers are alienated from a deeper reasoning on the semantic principles that are in place within the different components of the system. In this talk we will explore the semantic challenges, principles and perspectives behind the components of QA systems, aiming at providing a principled map and overview on the contribution of each component within the QA semantic interpretation goal.
Research in Artificial Intelligence has built upon the tools and techniques of many different disciplines, including formal logic, probability theory, decision theory, management science, linguistics and philosophy. However, the application of these disciplines in AI has necessitated the development of many enhancements and extensions.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Essentials of Automations: The Art of Triggers and Actions in FMESafe Software
In this second installment of our Essentials of Automations webinar series, we’ll explore the landscape of triggers and actions, guiding you through the nuances of authoring and adapting workspaces for seamless automations. Gain an understanding of the full spectrum of triggers and actions available in FME, empowering you to enhance your workspaces for efficient automation.
We’ll kick things off by showcasing the most commonly used event-based triggers, introducing you to various automation workflows like manual triggers, schedules, directory watchers, and more. Plus, see how these elements play out in real scenarios.
Whether you’re tweaking your current setup or building from the ground up, this session will arm you with the tools and insights needed to transform your FME usage into a powerhouse of productivity. Join us to discover effective strategies that simplify complex processes, enhancing your productivity and transforming your data management practices with FME. Let’s turn complexity into clarity and make your workspaces work wonders!
Enhancing Performance with Globus and the Science DMZGlobus
ESnet has led the way in helping national facilities—and many other institutions in the research community—configure Science DMZs and troubleshoot network issues to maximize data transfer performance. In this talk we will present a summary of approaches and tips for getting the most out of your network infrastructure using Globus Connect Server.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfPeter Spielvogel
Building better applications for business users with SAP Fiori.
• What is SAP Fiori and why it matters to you
• How a better user experience drives measurable business benefits
• How to get started with SAP Fiori today
• How SAP Fiori elements accelerates application development
• How SAP Build Code includes SAP Fiori tools and other generative artificial intelligence capabilities
• How SAP Fiori paves the way for using AI in SAP apps
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
2. An applied logician’s job is never
done…
When modeling an implemented system as a logic
you can start from the system
Or you can start from logics that could fit it
Hopefully the two meet up…
3. This talk: Off-the-shelf logical systems
The pieces of the
puzzle...
– FOL
– HOL
– Modal logic
– Description logic
– Hybrid logic
– MCS/LMS
– Intensional Logic
– Etc…
5. Motivation: Constructive Modalities?
Modalities and modal logic: the most
successful logical framework in CS
Temporal logic, knowledge operators, BDI
models, security issues, AI, natural language
understanding and inference, databases, etc..
Logic used both to create logical
representation of information and to reason
about it
Usually classical modalities
What about constructive modalities?
6. Motivation: Constructive Modalities?
Constructive logic: a logical basis for
programming via Curry-Howard
correspondences
Modalities extremely useful
Constructive modalities twice as useful?
examples from applications abound
Which constructive modalities?
Usual phenomenon: classical facts can be
construed in many different ways
constructively, choosing is an art...
7. •Constructive reasoning:
what, why, how...
What: Reasoning principles that are safer
if I ask you whether “There is x such that P(x)”,
I'm happier with an answer “yes, x_0”, than
with an answer “yes, for all x it is not the case
that not P(x)”.
Why: want reasoning to be as precise and safe
as possible
How: constructive reasoning as much as
possible, but classical if need be
8. A brief history
Debates over constructive or classical logics
since the beginning of the 20th century
Modal logics from 1920's - Lewis
Kripke-like semantics in the 60s.
Connections constructive/modal logic:
– Algebraic McKinsay/Tarski 30s
– Kripke semantics, for both 65
– Modal type theories, 90's
Putting constructive and modal together:
Fitch 1948 MIPC, Bull 1966, Prawitz 1965,
Curry,
10. Constructive modal logics
Basic ideas:
– Box, Diamond like forall/exists
– Intuitionistic logic like S4-modal logic,
– where A-->B = Box A → B
– Combining modalities not that easy...
To have ``intuitionistic modal logic” need to
have two modalities, how do they interact?
– Commuting squares possibilities
Adding syntax: hypersequents, labelled
deduction systems, adding semantics to
syntax (many ways...)
11. Constructive modal logics
Personal programme:
constructive modal logics with axioms,
sequents and natural deduction formulations
Also with algebraic, Kripke and categorical
semantics
With translations between formulations and
proved equivalences/embeddings
Translating proofs more than simply theorems
broad view of constructive and/or modality
12. Simpson Desiderata for IML '94
IML is a conservative extension of IPL.
IML contains all substitutions instances of
theorems of IPL and is closed under modus
ponen.
Adding excluded middle to IML yields a
standard classical modal logic
If “A or B” is a theorem of IML either A is a
theorem or B is a theorem too.
Box and Diamond are independent in IML.
(Intuitionistic) Meaning of the modalities, wrt it
IML is sound and complete
13. Extensions: Description and Hybrid
Logics
Description and Hybrid logics are closely
associated with modal logics
Both classes tend to be classical logics, for
the same reasons above
We discuss both constructive hybrid logics
(Brauner/dePaiva 03) and constructive
description logics (dePaiva05) in turn.
14. Constructive Hybrid Logic?
What are hybrid logics?
Extension of modal logic, where we make part
of the syntax of the formulae the worlds at
which they're evaluated.
Add to basic modal logic second kind of
propositional symbols (nominals) and
satisfaction operators
A nominal is assumed to be true at exactly one
world
A formula like a:A where a is a nominal and A
is a formula is called a satisfaction statement
15. Constructive Hybrid Logic!
Brauner/dePaiva ('03, '05)
Which kind of constructive?
Depends on kind of constructive modal logic
Many choices for syntax and for models.
Our choice: modal base Simpson-style,
Natural Deduction style.
Results: IHL as a ND system, models,
soundness and completeness, extensions to
geometric theories
Open problem: hybrid system CK style?...
16. What Are Description Logics?
A family of logic based Knowledge Representation
formalisms
– Descendants of semantic networks and KL-ONE
– Describe domain in terms of concepts (classes), roles
(properties, relationships) and individuals
Distinguished by:
– Formal semantics (typically model theoretic)
» Decidable fragments of FOL (often contained in C2)
» Closely related to Propositional Modal, Hybrid & Dynamic
Logics
» Closely related to Guarded Fragment
– Provision of inference services
» Decision procedures for key problems (satisfiability,
subsumption, etc)
» Implemented systems (highly optimised)
Thanks Ian Horrocks!
17. DL Basics
Concepts (formulae/unary predicates)
– E.g., Person, Doctor, HappyParent, etc.
Roles (modalities/relations)
– E.g., hasChild, loves
Individuals (nominals/constants)
– E.g., John, Mary, Italy
Operators (for forming concepts and roles) restricted so
that:
– Satisfiability/subsumption is decidable and, if possible, of low
complexity
– No need for explicit use of variables
– Features such as counting (graded modalities) succinctly
expressed
18. What are description logics?
A sublogic of FOL?
Or a sublogic of Modal logic?
FOL
t1
ALC
st
t2
Kn
19. Constructive Description Logic via
Translation
DL can be defined via t1 translation into FOL
To constructivize it transform FOL into IFOL
Call system IALC
DL can be defined via t2 translation into
multimodal K (Schilds91)
Need to choose a constructive K
Using IK (Simpson) call system iALC, using
CK (Mendler & de Paiva) call system cALC
20. Two translations
Into first-order logic t1:ALC → FOL
concept C maps to C(x), role R maps to
relation, quantifiers the point
Into modal logic t2:ALC → Kn, roles into
boxes, diamonds
21. Constructive Description Logic: IALC
Basic idea: translate description syntax using t1 into
IFOL, instead of FOL
No excluded middle, no duality between existential
and universal quantifiers, no duality between
conjunction and disjunction
Pros: IFOL fairly standard
– Can provide IALC models easily
Cons: semantics of IFOL more complicated…
Result: Given IALC model M, given formula Am M
satisfies A iff M satisfies t1(Α), that is
t1 is truth-preserving translation
22. Constructive Description Logic: iALC
and cALC
Basic idea: translate description syntax using
t2 into constructive modal logic, instead of
classical modal Kn.
Which constructive K?
If Simpson’s IK iALC,
if Mendler/de Paiva CK cALC
Difference: distribution of possibility over
disjunction and nullary one:
Dia (A or B) → Dia A or Dia B
Dia (false) → false
23. Constructive Description Logic II: iALC
Note that translation t2 into constructive
modal logic is the same for both iALC and
cALC, just the target language change.
For iALC, can use our work on intuitionistic
hybrid logic
Models easily described
Framework: several modal logics + geometric
theories
Referee’s remark: complexity?
24. Constructive Description Logic II:
cALC
For cALC, can use our work on an extended
Curry-Howard isomorphism for constructive
modal logic
No Framework: can only do S4 and K
Can do Kripke models and categorical
models
Haven’t investigated interpolation, decidability
or complexity
New work by Mendler and Schiele
25. Related Work
Mendler/Schiele on constructive description
for auditing
Bozzato, Ferrari et al, CHI for ALC, diff HH
and A Rademaker?
Odintsov and Wansing’s “Inconsistent-
tolerant description logic I and II”
– Motivation is paraconsistency, not constructivity
Hofmann’s “Proof theoretical Approach to DL”
– Motivation fixpoints in description logics and their
complexity
Straccia’s and Patel-Schneider’s papers on 4-
valued description logic
– Motivations are fuzziness and uncertainty
26. Discussion
This is very preliminary
While it is true that constructive reasoning multiply
concepts, there should be criteria to identify best
system(s?)
Part of bigger programme of constructivizing logics
for computer science
Want to keep criteria both from theory and
applications
Next steps: criteria from modal/hybrid logic,
bisimulations, complexity bounds, temporal logics,
etc…
27. References
Natural Deduction and Context as (Constructive) Modality (V. de
Paiva). In Proceedings of the 4th International and
Interdisciplinary Conference CONTEXT 2003, Stanford, CA,
USA, Springer Lecture Notes in Artificial Intelligence, vol 2680,
2003.
Constructive CK for Contexts (M. Mendler, V de Paiva), In
Proceedings of the Worskhop on Context Representation and
Reasoning, Paris, France, July 2005.
Intuitionistic Hybrid Logic (T. Brauner, V. de Paiva), Presented
at Methods for Modalities 3, LORIA, Nancy, France, September
22-23, 2003. Full paper in Journal of Applied Logic 2005
.Modalities in Constructive Logics and Type Theories Preface to
the special issue on Intuitionistic Modal Logic and Application of
the Journal of Logic and Computation, volume 14, number 4,
August 2004. Guest Editors: Valeria de Paiva, Rajeev Gore' and
Michael Mendler.
Constructive Description Logics: what, why and how. (extended
draft) Presented at Context Representation and Reasoning,
Riva del Garda, August 2006.