Static Analysis of Logic Programs via Boolean Networks

• URL: http://arxiv.org/abs/2407.09015v1
• Date: Fri, 12 Jul 2024 06:07:05 GMT
• Title: Static Analysis of Logic Programs via Boolean Networks
• Authors: Van-Giang Trinh, Belaid Benhamou,
• Abstract summary: "What can be said about stable models of a logic program from its static information?" has been investigated and proved useful in many circumstances. The proposed connection can bring the existing results in the rich history on static analysis of Boolean networks to explore and prove more theoretical results on ASP. The newly obtained insights have the potential to benefit many problems in the field of ASP.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Answer Set Programming (ASP) is a declarative problem solving paradigm that can be used to encode a combinatorial problem as a logic program whose stable models correspond to the solutions of the considered problem. ASP has been widely applied to various domains in AI and beyond. The question "What can be said about stable models of a logic program from its static information?" has been investigated and proved useful in many circumstances. In this work, we dive into this direction more deeply by making the connection between a logic program and a Boolean network, which is a prominent modeling framework with applications to various areas. The proposed connection can bring the existing results in the rich history on static analysis of Boolean networks to explore and prove more theoretical results on ASP, making it become a unified and powerful tool to further study the static analysis of ASP. In particular, the newly obtained insights have the potential to benefit many problems in the field of ASP.

Related papers

• ASP-Bench: From Natural Language to Logic Programs [27.126691338850254]
  We present a benchmark comprising 128 natural language problem instances, 64 base problems with easy and hard variants.<n>It evaluates systems that translate natural-language problems into Answer Set Programs (ASPs), a prominent form of logic programming.
  arXiv  Detail & Related papers  (2026-02-01T11:48:36Z)
• Logic-Driven Cybersecurity: A Novel Framework for System Log Anomaly Detection using Answer Set Programming [5.201769379977414]
  This study explores the application of Answer Set Programming (ASP) for detecting anomalies in system logs.<n>We propose a novel framework that leverages ASP's declarative nature and logical reasoning capabilities to encode complex security rules as logical predicates.
  arXiv  Detail & Related papers  (2025-12-04T15:37:32Z)
• Beyond the Black Box: Demystifying Multi-Turn LLM Reasoning with VISTA [20.43574322731524]
  VISTA is a web-based Visual Interactive System for Textual Analytics in multi-turn reasoning tasks.<n>It allows users to visualize the influence of context on model decisions and interactively modify conversation histories.<n>The platform is open-source and supports easy integration of custom benchmarks and local models.
  arXiv  Detail & Related papers  (2025-11-13T10:48:20Z)
• Counting Answer Sets of Disjunctive Answer Set Programs [28.739355096774155]
  We present SharpASP-SR, a novel framework for counting answer sets of disjunctive logic programs.<n>We show that SharpASP-SR significantly outperforms existing counters on instances with large answer set counts.
  arXiv  Detail & Related papers  (2025-07-15T18:41:19Z)
• ModelingAgent: Bridging LLMs and Mathematical Modeling for Real-World Challenges [72.19809898215857]
  We introduce ModelingBench, a novel benchmark featuring real-world-inspired, open-ended problems from math modeling competitions across diverse domains.<n>These tasks require translating natural language into formal mathematical formulations, applying appropriate tools, and producing structured, defensible reports.<n>We also present ModelingAgent, a multi-agent framework that coordinates tool use, supports structured, creative solutions, and generates well-grounded, creative solutions.
  arXiv  Detail & Related papers  (2025-05-21T03:33:23Z)
• Why Reasoning Matters? A Survey of Advancements in Multimodal Reasoning (v1) [66.51642638034822]
  Reasoning is central to human intelligence, enabling structured problem-solving across diverse tasks. Recent advances in large language models (LLMs) have greatly enhanced their reasoning abilities in arithmetic, commonsense, and symbolic domains. This paper offers a concise yet insightful overview of reasoning techniques in both textual and multimodal LLMs.
  arXiv  Detail & Related papers  (2025-04-04T04:04:56Z)
• Computational methods for Dynamic Answer Set Programming [0.0]
  This research aims to extend Answer Set Programming (ASP) to handle dynamic domains effectively. By integrating concepts from dynamic, temporal, and metric logics into ASP, we seek to develop robust systems capable of modeling complex dynamic problems.
  arXiv  Detail & Related papers  (2025-02-13T11:52:25Z)
• Agentic Reasoning: Reasoning LLMs with Tools for the Deep Research [7.4327380079414676]
  We introduce Agentic Reasoning, a framework that enhances large language model (LLM) reasoning by integrating external tool-using agents. Our framework introduces the Mind Map agent, which constructs a structured knowledge graph to track logical relationships. Evaluations on PhD-level scientific reasoning (GPQA) and domain-specific deep research tasks demonstrate that our approach significantly outperforms existing models.
  arXiv  Detail & Related papers  (2025-02-07T04:08:46Z)
• Data Analysis in the Era of Generative AI [56.44807642944589]
  This paper explores the potential of AI-powered tools to reshape data analysis, focusing on design considerations and challenges. We explore how the emergence of large language and multimodal models offers new opportunities to enhance various stages of data analysis workflow. We then examine human-centered design principles that facilitate intuitive interactions, build user trust, and streamline the AI-assisted analysis workflow across multiple apps.
  arXiv  Detail & Related papers  (2024-09-27T06:31:03Z)
• Coding for Intelligence from the Perspective of Category [66.14012258680992]
  Coding targets compressing and reconstructing data, and intelligence. Recent trends demonstrate the potential homogeneity of these two fields. We propose a novel problem of Coding for Intelligence from the category theory view.
  arXiv  Detail & Related papers  (2024-07-01T07:05:44Z)
• Understanding the Language Model to Solve the Symbolic Multi-Step Reasoning Problem from the Perspective of Buffer Mechanism [68.05754701230039]
  We construct a symbolic multi-step reasoning task to investigate the information propagation mechanisms in Transformer models.<n>We propose a random matrix-based algorithm to enhance the model's reasoning ability.
  arXiv  Detail & Related papers  (2024-05-24T07:41:26Z)
• Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Models [7.399563588835834]
  Interactive-KBQA is a framework designed to generate logical forms through direct interaction with knowledge bases (KBs) Our method achieves competitive results on the WebQuestionsSP, ComplexWebQuestions, KQA Pro, and MetaQA datasets.
  arXiv  Detail & Related papers  (2024-02-23T06:32:18Z)
• Large Language Models as Analogical Reasoners [155.9617224350088]
  Chain-of-thought (CoT) prompting for language models demonstrates impressive performance across reasoning tasks. We introduce a new prompting approach, analogical prompting, designed to automatically guide the reasoning process of large language models.
  arXiv  Detail & Related papers  (2023-10-03T00:57:26Z)
• Conjunctive Query Based Constraint Solving For Feature Model Configuration [79.14348940034351]
  We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
  arXiv  Detail & Related papers  (2023-04-26T10:08:07Z)
• Tools and Methodologies for Verifying Answer Set Programs [0.0]
  ASP is a powerful declarative programming paradigm commonly used for solving challenging search and optimization problems. As an approach to Knowledge Representation and Reasoning, ASP benefits from its simplicity, conciseness and rigorously defined semantics. My research is concerned with extending the theory and tools supporting the verification of ASP progams.
  arXiv  Detail & Related papers  (2022-08-05T10:50:21Z)
• Efficient lifting of symmetry breaking constraints for complex combinatorial problems [9.156939957189502]
  This work extends the learning framework and implementation of a model-based approach for Answer Set Programming. In particular, we incorporate a new conflict analysis algorithm in the Inductive Logic Programming system ILASP.
  arXiv  Detail & Related papers  (2022-05-14T20:42:13Z)
• 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)
• On the Configuration of More and Less Expressive Logic Programs [11.331373810571993]
  We consider two well-known model-based AI methodologies, SAT and ASP, define a number of syntactic features that may characterise their inputs. Results of a wide experimental analysis involving SAT and ASP domains, taken from respective competitions, show the different advantages that can be obtained by using input reformulation and configuration.
  arXiv  Detail & Related papers  (2022-03-02T10:55:35Z)
• AR-LSAT: Investigating Analytical Reasoning of Text [57.1542673852013]
  We study the challenge of analytical reasoning of text and introduce a new dataset consisting of questions from the Law School Admission Test from 1991 to 2016. We analyze what knowledge understanding and reasoning abilities are required to do well on this task.
  arXiv  Detail & Related papers  (2021-04-14T02:53:32Z)
• BARD: A structured technique for group elicitation of Bayesian networks to support analytic reasoning [2.30529156118173]
  BARD (Bayesian ARgumentation via Delphi) is both a methodology and an expert system. It is an end-to-end online platform, with associated online training, for groups without prior BN expertise to understand and analyse a problem. Initial experimental results demonstrate that BARD aids in problem solving, reasoning and collaboration.
  arXiv  Detail & Related papers  (2020-03-02T21:55:35Z)

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.