Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System

• URL: http://arxiv.org/abs/2507.05519v5
• Date: Tue, 05 Aug 2025 14:42:51 GMT
• Title: Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System
• Authors: Gopal Gupta, Abhiramon Rajasekharan, Alexis R. Tudor, Elmer Salazar, Joaquín Arias,
• Abstract summary: We show how (deontic) modal operators can be expressed elegantly using default negation and strong negation.<n>We propose using global constraints of ASP to represent obligations and impermissibilities of deontic modal logic.
• Score: 1.4680035572775536
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We consider the problem of implementing deontic modal logic. We show how (deontic) modal operators can be expressed elegantly using default negation (negation-as-failure) and strong negation present in answer set programming (ASP). We propose using global constraints of ASP to represent obligations and impermissibilities of deontic modal logic. We show that our proposed representation results in the various paradoxes of deontic modal logic being elegantly resolved.

Related papers

• Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds [55.2480439325792]
  This article develops a novel framework for modal logic based on the idea of stratified actualization.<n>Traditional Kripke semantics treat modal operators as quantification over fully determinate alternatives.<n>We propose a system Stratified Actualization Logic (SAL) in which modalities are indexed by levels of ontological stability, interpreted as admissibility.
  arXiv  Detail & Related papers  (2025-06-12T18:35:01Z)
• $\ exttt{SEM-CTRL}$: Semantically Controlled Decoding [53.86639808659575]
  $texttSEM-CTRL$ is a unified approach that enforces rich context-sensitive constraints and task- and instance-specific semantics directly on an LLM decoder.<n>texttSEM-CTRL$ allows small pre-trained LLMs to efficiently outperform larger variants and state-of-the-art reasoning models.
  arXiv  Detail & Related papers  (2025-03-03T18:33:46Z)
• Pearce's Characterisation in an Epistemic Domain [0.0]
  Equilibrium logic (EL) is a general-purpose nonmonotonic reasoning formalism.<n>Epistemic specifications (ES) are extensions of ASP-programs with subjective literals.<n>ES-programs are interpreted by world-views, which are essentially collections of answer-sets.
  arXiv  Detail & Related papers  (2025-02-13T11:50:36Z)
• Direct Encoding of Declare Constraints in ASP [9.599644507730106]
  We introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules.<n>We assess the effectiveness of this novel approach on two Process Mining tasks.
  arXiv  Detail & Related papers  (2024-12-13T14:11:33Z)
• Enabling Natural Zero-Shot Prompting on Encoder Models via Statement-Tuning [55.265138447400744]
  Statement-Tuning is a technique that models discriminative tasks as a set of finite statements and trains an encoder model to discriminate between the potential statements to determine the label. Experimental results demonstrate that Statement-Tuning achieves competitive performance compared to state-of-the-art LLMs with significantly fewer parameters. The study investigates the impact of several design choices on few-shot and zero-shot generalization, revealing that Statement-Tuning can achieve strong performance with modest training data.
  arXiv  Detail & Related papers  (2024-04-19T14:05:03Z)
• Automated legal reasoning with discretion to act using s(LAW) [0.294944680995069]
  ethical and legal concerns make it necessary for automated reasoners to justify in human-understandable terms. We propose to use s(CASP), a top-down execution model for predicate ASP, to model vague concepts following a set of patterns. We have implemented a framework, called s(LAW), to model, reason, and justify the applicable legislation and validate it by translating (and benchmarking) a representative use case.
  arXiv  Detail & Related papers  (2024-01-25T21:11:08Z)
• Language Models can be Logical Solvers [99.40649402395725]
  We introduce LoGiPT, a novel language model that directly emulates the reasoning processes of logical solvers. LoGiPT is fine-tuned on a newly constructed instruction-tuning dataset derived from revealing and refining the invisible reasoning process of deductive solvers.
  arXiv  Detail & Related papers  (2023-11-10T16:23:50Z)
• Meaning Representations from Trajectories in Autoregressive Models [106.63181745054571]
  We propose to extract meaning representations from autoregressive language models by considering the distribution of all possible trajectories extending an input text. This strategy is prompt-free, does not require fine-tuning, and is applicable to any pre-trained autoregressive model. We empirically show that the representations obtained from large models align well with human annotations, outperform other zero-shot and prompt-free methods on semantic similarity tasks, and can be used to solve more complex entailment and containment tasks that standard embeddings cannot handle.
  arXiv  Detail & Related papers  (2023-10-23T04:35:58Z)
• Deontic Paradoxes in ASP with Weak Constraints [0.0]
  We show how to encode and resolve several well-known deontic paradoxes utilizing weak constraints. We present a methodology for translating normative systems in ASP with weak constraints. This methodology is applied to "ethical" versions of Pac-man, where we obtain a comparable performance with related works, but ethically preferable results.
  arXiv  Detail & Related papers  (2023-08-30T08:56:54Z)
• A Hybrid System for Systematic Generalization in Simple Arithmetic Problems [70.91780996370326]
  We propose a hybrid system capable of solving arithmetic problems that require compositional and systematic reasoning over sequences of symbols. We show that the proposed system can accurately solve nested arithmetical expressions even when trained only on a subset including the simplest cases.
  arXiv  Detail & Related papers  (2023-06-29T18:35:41Z)
• Avoiding Pragmatic Oddity: A Bottom-up Defeasible Deontic Logic [1.160208922584163]
  This paper presents an extension of Defeasible Deontic Logic to deal with the Pragmatic Oddity problem. The logic applies three general principles: (1) the Pragmatic Oddity problem must be solved within a general logical treatment of CTD reasoning; (2) non-monotonic methods must be adopted to handle CTD reasoning; and (3) logical models of CTD reasoning must be computationally feasible and, if possible, efficient.
  arXiv  Detail & Related papers  (2022-09-09T23:14:09Z)
• PVS Embeddings of Propositional and Quantified Modal Logic [0.0]
  This report describes embeddings of propositional and quantified modal logic in the PVS verification system. The resources of PVS allow this to be done in an attractive way that supports much of the standard syntax of modal logic.
  arXiv  Detail & Related papers  (2022-05-12T22:44:29Z)
• Logically Consistent Adversarial Attacks for Soft Theorem Provers [110.17147570572939]
  We propose a generative adversarial framework for probing and improving language models' reasoning capabilities. Our framework successfully generates adversarial attacks and identifies global weaknesses. In addition to effective probing, we show that training on the generated samples improves the target model's performance.
  arXiv  Detail & Related papers  (2022-04-29T19:10:12Z)
• Public Announcement Logic in HOL [0.0]
  shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic.
  arXiv  Detail & Related papers  (2020-10-02T06:46:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.