Results 1 - 10 of 197

Incremental Answer Set Programming: A Preliminary Report

by Mona Gharib, Robert Mercer, Torsten Schaub
"... Abstract. An alternative approach to answer set programming is developed in order to remedy the problems of “relevance ” and “modularity ” of answer set semantics for logic programs. The fundamental idea is to re-introduce monotonicity. In particular, we introduce the alternative concept of ι-answer ..."
Abstract - Add to MetaCart
Abstract. An alternative approach to answer set programming is developed in order to remedy the problems of “relevance ” and “modularity ” of answer set semantics for logic programs. The fundamental idea is to re-introduce monotonicity. In particular, we introduce the alternative concept of ι-answer

Semantical Characterizations and Complexity of Equivalences in Answer Set Programming

by Thomas Eiter, Michael Fink, Stefan Woltran - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC , 2007
"... In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R have the same answer sets for any other program R. This property strengthens the equivalence of P and Q with respect to answe ..."
Abstract - Cited by 32 (12 self) - Add to MetaCart
as some restricted classes, providing semantical characterizations and analyzing the computational complexity. Our results, which naturally extend to answer set semantics for programs with strong negation, complement the results on strong

Answer set programming with constraints using lazy grounding

by A. Dal Palù, A. Dovier, E. Pontelli, G. Rossi - In Proceedings of ICLP’09 , 2009
"... Abstract. The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be completely realized within the framework of Co ..."
Abstract - Cited by 16 (0 self) - Add to MetaCart
Abstract. The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be completely realized within the framework

A Preliminary Report on Integrating of Answer Set and Constraint Solving

by Sabrina Baselice, Piero Bonatti, M. Gelfond
"... Abstract. Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning starts. This prevents ASP to be effective on several classes of problems. In ..."
Abstract - Add to MetaCart
Abstract. Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input program before the actual reasoning starts. This prevents ASP to be effective on several classes of problems

A New Algorithm for Answer Set Computation over Parallel and Distributed Architectures: Preliminary Report

by Giuliano Grossi, Massimo Marchi
"... This paper presents some preliminary results obtained in the development of a new branch-and-bound algorithm for Answer Set Programming. We exploit the intrinsic parallelism of branch-and-bound to distribute the computation among agents that cooperate to find an answer set for the problem instance a ..."
Abstract - Add to MetaCart
This paper presents some preliminary results obtained in the development of a new branch-and-bound algorithm for Answer Set Programming. We exploit the intrinsic parallelism of branch-and-bound to distribute the computation among agents that cooperate to find an answer set for the problem instance

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence ⋆

by Jörg Pührer, Hans Tompits, Stefan Woltran
"... Abstract. The study of different notions of equivalence is one of the cornerstones of current research in answer-set programming. This is mainly motivated by the needs of program simplification and modular programming, for which ordinary equivalence is insufficient. A recently introduced equivalence ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Abstract. The study of different notions of equivalence is one of the cornerstones of current research in answer-set programming. This is mainly motivated by the needs of program simplification and modular programming, for which ordinary equivalence is insufficient. A recently introduced

Alternative Characterizations for Program Equivalence under Answer-Set Semantics based on Unfounded Sets

by Martin Gebser, Torsten Schaub, Hans Tompits, Stefan Woltran , 2007
"... Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one hand, concepts like loops and elementary sets have been proposed in order to extend Clark’s completion for computing a ..."
Abstract - Cited by 6 (6 self) - Add to MetaCart
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one hand, concepts like loops and elementary sets have been proposed in order to extend Clark’s completion for computing

Schema selection and stochastic inference in modular environments

by Paul Smolensky - In Proceedings of the National Conference on Artificial Intelligence , 1983
"... Given a set of stimuli presenting views of some environment, how can one characterize the natural modules or “objects ” that compose the environment? Should a given set of items be encoded as a collection of instances or as a set of rules? Restricted formulations of these questions are addressed by ..."
Abstract - Cited by 24 (13 self) - Add to MetaCart
in the environment, and how should they be encoded? This paper presents preliminary results of research founded on the hypothesis that in real environments there exist reguIarities that can be idealized as mathematical structures that are simpIe enough to be anaIyxabIe. Only the simpIest kind of reguhuity

Music, Modularity and Syntax

by Joseph Hilferty
"... First generation cognitive science has always maintained that the mind/brain is a modular system. This has been especially apparent in linguistics, where the modularity thesis goes largely unquestioned by the linguistic mainstream. Cognitive linguists have long disputed the reality of modular archit ..."
Abstract - Add to MetaCart
architectures of grammar. Instead of conceiving syntax as a computational system of a relatively small set of formal principles and parameters, cognitive linguists take the notion of grammatical construction to be the basic unit of syntax: syntax is simply our repertoire of form-meaning pairings. On such a view

Music, Modularity and Syntax

by Javier Valenzuela, Joseph Hilferty
"... First generation cognitive science has always maintained that the mind/brain is a modular system. This has been especially apparent in linguistics, where the modularity thesis goes largely unquestioned by the linguistic mainstream. Cognitive linguists have long disputed the reality of modular archit ..."
Abstract - Add to MetaCart
architectures of grammar. Instead of conceiving syntax as a computational system of a relatively small set of formal principles and parameters, cognitive linguists take the notion of grammatical construction to be the basic unit of syntax: syntax is simply our repertoire of form-meaning pairings. On such a view
Results 1 - 10 of 197