Results 1  10
of
17
Communicating ASP and the polynomial hierarchy
 Proceedings of LPNMR11
, 2011
"... Abstract. Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expressiveness of this framework crucially depends on the nature of the communication mechanism that is adopted. Th ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
previously decided. We show that extending answer set programs in this way allows us to capture the entire polynomial hierarchy. 1
Solving Problems on the Second Level of the Polynomial Hierarchy 1
"... We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ P 2 /Π P 2hard ASP programs while maintaining the benign behaviour of the wellassessed heuristic of DLV on NP problems. We experiment with the new heuristic on ..."
Abstract
 Add to MetaCart
We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ P 2 /Π P 2hard ASP programs while maintaining the benign behaviour of the wellassessed heuristic of DLV on NP problems. We experiment with the new heuristic
Solving Hard Problems for the Second Level of the Polynomial Hierarchy: Heuristics and Benchmark
 INTELLIGENZA ARTIFICIALE
, 2005
"... Recent research on answer set programming (ASP) systems, has mainly focused on ¢¤ £ solving problems more efficiently. Yet, disjunctive logic programs allow for expressing every problem in the complexity ¥ classes ¨ and. These classes are widely believed to be strictly larger ¢© £ than, and several ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Recent research on answer set programming (ASP) systems, has mainly focused on ¢¤ £ solving problems more efficiently. Yet, disjunctive logic programs allow for expressing every problem in the complexity ¥ classes ¨ and. These classes are widely believed to be strictly larger ¢© £ than
Under consideration for publication in Theory and Practice of Logic Programming 1 Expressiveness of Communication in Answer Set Programming
, 2011
"... Answer set programming (ASP) is a form of declarative programming that allows to succinctly formulate and efficiently solve complex problems. An intuitive extension of this formalism is communicating ASP, in which multiple ASP programs collaborate to solve the problem at hand. However, the expressiv ..."
Abstract
 Add to MetaCart
in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate. Second, we modify the communication mechanism to also allow us to focus on a sequence of communicating programs, where each program in the sequence may successively remove some of the
Answer Set Programming with External Sources
"... Answer Set Programming (ASP) is a wellknown problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information, HEXprograms extend programs with external atoms, which allow for a bidirectional communication between the logic program and ext ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Answer Set Programming (ASP) is a wellknown problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information, HEXprograms extend programs with external atoms, which allow for a bidirectional communication between the logic program
HierKNEM: An Adaptive Framework for KernelAssisted and TopologyAware Collective Communications on Manycore Clusters
"... Abstract—Multicore Clusters, which have become the most prominent form of High Performance Computing (HPC) systems, challenge the performance of MPI applications with non uniform memory accesses and shared caches hierarchies. Recent advances in MPI collective communications have alleviated the perfo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—Multicore Clusters, which have become the most prominent form of High Performance Computing (HPC) systems, challenge the performance of MPI applications with non uniform memory accesses and shared caches hierarchies. Recent advances in MPI collective communications have alleviated
Towards automated integration of guess and check programs in answer set programming: a metainterpreter and applications
, 2004
"... Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NPcomplete problems can be encoded in the answer set semantics of logic programs in a very concise and intuitive way, where the encoding reflects the typical " ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
level of the polynomial hierarchy. While these problems also have a clear "guess and check" structure, an encoding in a DLP reflecting it intuitively may sometimes be a nonobvious task, in particular if the "check" itself is a coNPcomplete problem; usually, such problems
Complexity of fuzzy answer set programming under Lukasiewicz
"... Fuzzy answer set programming (FASP) is a generalization of answer set programming (ASP) in which propositions are allowed to be graded. Little is known about the computational complexity of FASP and almost no techniques are available to compute the answer sets of a FASP program. In this paper, we ..."
Abstract
 Add to MetaCart
which does not affect the expressivity of ASP in the classical case – the picture changes drastically. In particular, reasoning tasks are then located at the second level of the polynomial hierarchy, while for simple FASP programs, we can only show that the unique answer set can be found in pseudopolynomial
Improving HEXProgram Evaluation based on Unfounded Sets
 INSTITUT FÜR INFORMATIONSSYSTEME, TECHNISCHE UNIVERSITÄT WIEN, A1040
, 2013
"... ... atoms. As already reasoning from Horn programs with nonmonotonic external atoms of polynomial complexity is on the second level of the polynomial hierarchy, minimality checking of answer set candidates needs special attention. To this end, we present an approach based on unfounded sets as a gene ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
... atoms. As already reasoning from Horn programs with nonmonotonic external atoms of polynomial complexity is on the second level of the polynomial hierarchy, minimality checking of answer set candidates needs special attention. To this end, we present an approach based on unfounded sets as a
Efficient HEXProgram Evaluation Based on Unfounded Sets
, 2014
"... HEXprograms extend logic programs under the answer set semantics with external computations through external atoms. As reasoning from ground Horn programs with nonmonotonic external atoms of polynomial complexity is already on the second level of the polynomial hierarchy, minimality checking of a ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
HEXprograms extend logic programs under the answer set semantics with external computations through external atoms. As reasoning from ground Horn programs with nonmonotonic external atoms of polynomial complexity is already on the second level of the polynomial hierarchy, minimality checking
Results 1  10
of
17