paper-with-me

Papers

A Machine Learning guided Rewriting Approach for ASP Logic Programs

2020-09-22 · Elena Mastria, Jessica Zangari, Simona Perri, Francesco Calimeri

Answer Set Programming (ASP) is a declarative logic formalism that allows to encode computational problems via logic programs. Despite the declarative nature of the formalism, some advanced expertise is required, in general, for designing an ASP encoding that can be efficiently evaluated by an actual ASP system. A common way for trying to reduce the burden of manually tweaking an ASP program consists in automatically rewriting the input encoding according to suitable techniques, for producing alternative, yet semantically equivalent, ASP programs. However, rewriting does not always grant benefits in terms of performance; hence, proper means are needed for predicting their effects with this respect. In this paper we describe an approach based on Machine Learning (ML) to automatically decide whether to rewrite. In particular, given an ASP program and a set of input facts, our approach chooses whether and how to rewrite input rules based on a set of features measuring their structural properties and domain information. To this end, a Multilayer Perceptrons model has then been trained to guide the ASP grounder I-DLV on rewriting input rules. We report and discuss the results of an experimental evaluation over a prototypical implementation.

📄 PDF Abstract BibTeX arXiv:2009.10252

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

Computing Horn Rewritings of Description Logics Ontologies

2015-04-20 · Mark Kaminski, Bernardo Cuenca Grau

We study the problem of rewriting an ontology O1 expressed in a DL L1 into an ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when extended with an arbitrary dataset. Ontologies that admit such rewrit…

System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics

2023-03-29 · Daniel Bresnahan, Nicholas Hippen, Yuliya Lierler

Answer set programming is a declarative logic programming paradigm geared towards solving difficult combinatorial search problems. While different logic programs can encode the same problem, their performance may vary si…

Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

2019-01-26 · Yuliya Lierler

Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing different knowledge representation formalisms. Frequently, several related and yet…

PR2: Peephole Raw Pointer Rewriting with LLMs for Translating C to Safer Rust

2025-05-07 · YiFei Gao, Chengpeng Wang, Pengxiang Huang, Xuwei Liu 외

There has been a growing interest in translating C code to Rust due to Rust's robust memory and thread safety guarantees. Tools such as C2RUST enable syntax-guided transpilation from C to semantically equivalent Rust cod…

C++ code

Logic Synthesis with Generative Deep Neural Networks

2024-06-07 · Xihan Li, Xing Li, Lei Chen, Xing Zhang 외

While deep learning has achieved significant success in various domains, its application to logic circuit design has been limited due to complex constraints and strict feasibility requirement. However, a recent generativ…