Results 51 to 60 of about 570,700 (231)
Epistemic Answer Set Programming [PDF]
, 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 +4 more sources
Transition Systems for Model Generators - A Unifying Approach [PDF]
, 2011 A fundamental task for propositional logic is to compute models of propositional formulas. Programs developed for this task are called satisfiability solvers.
Denecker +11 more
core +4 more sources
Combining graph and flux-based structures to decipher phenotypic essential metabolites within metabolic networks [PDF]
PeerJ, 2017 Background The emergence of functions in biological systems is a long-standing issue that can now be addressed at the cell level with the emergence of high throughput technologies for genome sequencing and phenotyping.
Julie Laniau +8 more
doaj +2 more sources
Dreptul Algoritmic // Algorithmic Law
Analele Ştiinţifice ale Universităţii "Al.I. Cuza" din Iaşi. Ştiinţe Juridice, 2021 The law is a set of rules of social coexistence, so it is natural to ask ourselves whether legal rules can be “translated” into a programming language that provides the algorithmic solution to a legal problem. “If” the answer is positive, “then” what are
Silvia Uscov
doaj +1 more source
Learning Weak Constraints in Answer Set Programming [PDF]
, 2015 This paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set Programming (ASP).
Broda, Krysia +2 more
core +2 more sources
Intrinsic Prioritization in Answer Set Programming Based on an Adapted Notion of Tolerance
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceAnswer set programming (ASP) is a declarative programming language suited to solve complex combinatorial search problems. Prioritized ASP is the subdiscipline of ASP which aims at prioritizing the models (answer sets) of ASP programs.
Marco Wilhelm +2 more
doaj +1 more source
Algorithms, 2023 Incremental techniques aim at making it possible to improve the performance of the grounding and solving processes by reusing the results of previous executions. Clingo supports both incremental grounding and incremental solving computations. In order to
Marcello Balduccini +2 more
doaj +1 more source
Rewriting recursive aggregates in answer set programming: back to monotonicity [PDF]
, 2015 Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall performance ...
Alviano +13 more
core +2 more sources
Integrated Use of System Z for Preferred Answer Set Programming
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceAnswer set programming (ASP) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive rule-based syntax, fast solvers, and is suited
Marco Wilhelm +2 more
doaj +1 more source
Imperative Program Synthesis from Answer Set Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Our research concerns generating imperative programs from Answer Set Programming Specifications. ASP is highly declarative and is ideal for writing specifications.
Sarat Chandra Varanasi
doaj +1 more source