Results 61 to 70 of about 33,717 (206)

Temporal Answer Set Programming

, 2020
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving. Such programs are the result of combining usual rules with temporal modal operators, as in Linear-time Temporal Logic (LTL). We focus on recent results of the non-monotonic formalism called Temporal
Aguado, Felicidad, Cabalar, Pedro, Dieguez, Martin, Perez, Gilberto, Schaub, Torsten, Schuhmann, Anna, Vidal, Concepcion   +6 more
openaire   +2 more sources

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

, 2023
Daniel Bresnahan, Nicholas Hippen, Yuliya Lierler   +2 more
openalex   +1 more source

Sketched Answer Set Programming [PDF]

2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018
Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Answer Set Programming (SkASP), aiming at supporting the user in resolving this issue. The user writes an ASP program while marking uncertain parts open with question marks.
Paramonov, Sergey, Bessiere, Christian, Dries, Anton, De Raedt, Luc   +3 more
openaire   +4 more sources

Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming [PDF]

, 2021
Joaquín Arias, Manuel Carro, Zhuo Chen, Gopal Gupta   +3 more
openalex   +1 more source

Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP.
Marco De Bortoli
doaj   +1 more source

Teaching logic programming: a review

CTE Workshop Proceedings
Logic programming constitutes a significant paradigm within computer science, offering a unique approach to programming based on formal logic rather than conventional imperative instructions.
Serhiy O. Semerikov, Iryna S. Mintii, Natalia V. Moiseienko   +2 more
doaj   +1 more source

Counting Answer Sets of Disjunctive Answer Set Programs

Theory and Practice of Logic Programming
Abstract Answer Set Programming (ASP) provides a powerful declarative paradigm for knowledge representation and reasoning. Recently, counting answer sets has emerged as an important computational problem with applications in probabilistic reasoning, network reliability analysis, and other domains.
MD MOHIMENUL KABIR, SUPRATIK CHAKRABORTY, KULDEEP S. MEEL   +2 more
openaire   +2 more sources

Communicating Answer Set Programs

, 2010
Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been
Bauters, Kim, Janssen, Jeroen, Schockaert, Steven, Vermeir, Dirk, De Cock, Martine   +4 more
openaire   +5 more sources

Fuzzy Answer Set Programming [PDF]

, 2006
In this paper we show how the concepts of answer set programming and fuzzy logic can be succesfully combined into the single framework of fuzzy answer set programming (FASP). The framework offers the best of both worlds: from the answer set semantics, it inherits the truly declarative non-monotonic reasoning capabilities while, on the other hand, the ...
Vermeir, Dirk, Van Nieuwenborgh, Davy, De Cock, Martine   +2 more
openaire   +2 more sources

ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks

Algorithms for Molecular Biology, 2017
Background This paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks (AN).
Emna Ben Abdallah, Maxime Folschette, Olivier Roux, Morgan Magnin   +3 more
doaj   +1 more source