Results 31 to 40 of about 33,717 (206)

Functional answer set programming [PDF]

open access: yesTheory and Practice of Logic Programming, 2011
AbstractIn this paper we propose an extension of Answer Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL=ℱwhere the set of functions is partitioned into Herbrand functions (orconstructors) and ...
openaire   +2 more sources

An Application of Declarative Languages in Distributed Architectures: ASP and DALI Microservices

open access: yesInternational Journal of Interactive Multimedia and Artificial Intelligence, 2021
In this paper we introduce an approach to the possible adoption of Answer Set Programming (ASP) for the definition of microservices, which are a successful abstraction for designing distributed applications as suites of independently deployable ...
Stefania Costantini   +2 more
doaj   +1 more source

Open answer set programming with guarded programs [PDF]

open access: yesACM Transactions on Computational Logic, 2008
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants. We define a fixed-point logic (FPL) extension of Clark's completion such that open answer sets correspond to models of FPL formulas and identify a syntactic subclass of programs, called ...
Heymans, Stijn   +2 more
openaire   +3 more sources

ASP-Based Declarative Reasoning in Data-Intensive Enterprise and IoT Applications

open access: yesAlgorithms, 2023
In the last few years, we have witnessed the spread of computing devices getting smaller and smaller (e.g., Smartphones, Smart Devices, Raspberry, etc.), and the production and availability of data getting bigger and bigger.
Francesco Calimeri   +7 more
doaj   +1 more source

Possibilistic Answer Set Programming Revisited [PDF]

open access: yes, 2010
Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results.
Bauters, Kim   +3 more
openaire   +4 more sources

Possible and Necessary Answer Sets of Possibilistic Answer Set Programs [PDF]

open access: yes2012 IEEE 24th International Conference on Tools with Artificial Intelligence, 2012
Answer set programming (ASP) and possibility theory can be combined to form possibilistic answer set programming (PASP), a framework for non-monotonic reasoning under uncertainty. Existing proposals view answer sets of PASP programs as weighted epistemic states, in which the strength by which different literals are believed to hold may vary.
Bauters, Kim   +3 more
openaire   +5 more sources

Complexities of Logic Programs with Convex Aggregates [PDF]

open access: yesJisuanji kexue
ASP is a paradigm for descriptive problem solving and is widely used in fields such as planning,diagnosis,scheduling and bioinformatics.To enhance the expressive power of ASP,it has introduced aggregate functions from database systems and proposed ...
WANG Xianglong, WANG Yisong, XIE Zhongtao
doaj   +1 more source

Epistemic Answer Set Programming [PDF]

open access: yes, 2019
This paper introduces a new epistemic extension of answer set programming (\(\mathsf {ASP}\)) called epistemic ASP (\(\mathsf {E\text {-}\mathsf {ASP}}\)). Then, it compares \(\mathsf {E\text {-}\mathsf {ASP}}\) with existing approaches, showing the advantages and the novelties of the new semantics and discusses which formalisms provide more intuitive ...
openaire   +2 more sources

Computing preferred answer sets by meta-interpretation in Answer Set Programming [PDF]

open access: yesTheory and Practice of Logic Programming, 2003
Most recently, Answer Set Programming (ASP) is attracting interest as a new paradigm for problem solving. An important aspect which needs to be supported is the handling of preferences between rules, for which several approaches have been presented. In this paper, we consider the problem of implementing preference handling approaches by means of meta ...
THOMAS EITER   +3 more
openaire   +3 more sources

Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs

open access: yesAlgorithms, 2022
Answer Set Programming (ASP) is a well established logical approach in artificial intelligence that is widely used for knowledge representation and problem solving.
Jorge Fandinno   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy