Results 161 to 170 of about 33,717 (206)

Superoptimisation: provably optimal code generation using answer set programming

, 2009
T Crick
openalex   +1 more source

Leveraging Large Language Models and Agent-Based Systems for Scientific Data Analysis: Validation Study.

JMIR Ment Health
Peasley D, Kuplicki R, Sen S, Paulus M.
europepmc   +1 more source

Synthesizing Concurrent Programs Using Answer Set Programming [PDF]

Fundamenta Informaticae, 2012
We address the problem of the automatic synthesis of concurrent programs within a framework based on Answer Set Programming (ASP). Every concurrent program to be synthesized is specified by providing both the behavioural and the structural properties it should satisfy.
De Angelis E, Pettorossi A, Proietti M
openaire   +12 more sources

Some of the next articles are maybe not open access.

Related searches:

Monotonic Answer Set Programming

Journal of Logic and Computation, 2008
Answer set programming (ASP) does not allow for incrementally constructing answer sets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon an alternative approach to ASP that allows for incremental constructions.
Gebser, Martin (Dr.), Gharib, Mona, Mercer, Robert E., Schaub, Torsten (Prof. Dr.)   +3 more
openaire   +2 more sources

Answer Set Programming Modulo Acyclicity

Fundamenta Informaticae, 2015
Acyclicity constraints are prevalent in knowledge representation and applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The
Bomanson, Jori, Janhunen, Tomi, Schaub, Torsten (Prof. Dr.), Gebser, Martin (Dr.), Kaufmann, Benjamin   +4 more
openaire   +4 more sources

Answer Set Programming

2010
Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming under the stable model semantics (DLP), is a powerful formalism for Knowledge Representation and Reasoning. ASP has been the subject of intensive research studies, and, also thanks to the availability of some efficient ASP systems, has recently gained quite some popularity ...
P. A. BONATTI, CALIMERI, Francesco, LEONE, Nicola, RICCA, Francesco   +3 more
openaire   +4 more sources

Shift Design with Answer Set Programming

Fundamenta Informaticae, 2015
Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling and travel allotment.
Abseher, Michael, Musliu, Nysret, Woltran, Stefan, Gebser, Martin, Schaub, Torsten   +4 more
openaire   +5 more sources

Probabilistic Answer Set Programming

2013 Brazilian Conference on Intelligent Systems, 2013
This paper introduces a technique called Probabilistic Answer Set Programming (PASP), that allows modeling complex theories and checking its satisfiability with respect to a set of probabilistic data. We propose an algorithm for PASP processing based on a Turing reduction method to ASP.
Eduardo Menezes de Morais, Marcelo Finger   +1 more
openaire   +1 more source

Simulating Sets in Answer Set Programming

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
We study the extension of non-monotonic disjunctive logic programs with terms that represent sets of constants, called DLP(S), under the stable model semantics. This strictly increases expressive power, but keeps reasoning decidable, though cautious entailment is coNEXPTIME^NP-complete, even for data complexity. We present two new reasoning methods for
Sarah Alice Gaggl, Philipp Hanisch, Markus Krötzsch   +2 more
openaire   +1 more source