Results 261 to 270 of about 106,052 (303)

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.
Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub, Stefan Woltran   +4 more
openaire   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Answer Set Programming in Linguistics

KI - Kunstliche Intelligenz, 2018
This survey collects scientific works where answer set programming, a declarative knowledge representation and reasoning formalism, is applied to natural language processing and computational linguistics.
Peter Schuller, Schuller Peter
exaly   +2 more sources

Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence, 2011
The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modelling power of ASP in terms of natural and concise problem representations.
Wolfgang Faber, Gerald Pfeifer, Nicola Leone   +2 more
exaly   +2 more sources

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.
Martin Gebser, Mona Gharib, Robert E. Mercer, Torsten Schaub   +3 more
openaire   +2 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

Answer set programming at a glance

Communications of the ACM, 2011
The motivation and key concepts behind answer set programming---a promising approach to declarative problem solving.
Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski   +2 more
openaire   +2 more sources

Computing Preferred Answer Sets in Answer Set Programming

2003
Prioritized logic programs (PLPs) have a mechanism of representing priority knowledge in logic programs. The declarative semantics of a PLP is given as preferred answer sets which are used for representing nonmonotonic reasoning as well as preference abduction.
Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta   +3 more
openaire   +1 more source

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

Answer Set Programming

2013
Answer Set Programming (ASP) evolved from various fields such as Logic Programming, Deductive Databases, Knowledge Representation, and Nonmonotonic Reasoning, and serves as a flexible language for declarative problem solving. There are two main tasks in problem solving, representation and reasoning, which are clearly separated in the declarative ...
openaire   +2 more sources