Results 1 - 10 of 201

The Second Answer Set Programming Competition

by Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser
"... Abstract. This paper reports on the Second Answer Set Programming Competition. The competitions in areas of Satisfiability checking, Pseudo-Boolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing syste ..."
Abstract - Cited by 48 (12 self) - Add to MetaCart
Abstract. This paper reports on the Second Answer Set Programming Competition. The competitions in areas of Satisfiability checking, Pseudo-Boolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing

The fourth answer set programming competition: Preliminary report

by Mario Alviano , Francesco Calimeri , Günther Charwat , Minh Dao-Tran , Carmine Dodaro , Giovambattista Ianni , Thomas Krennwallner , Martin Kronegger , Johannes Oetsch , Andreas Pfandler , Jörg Pührer , Christoph Redl , Francesco Ricca , Patrik Schneider , Martin Schwengerer , Lara Katharina Spendier , Johannes Peter Wallner , Guohui Xiao - In Proc. LPNMR 2013, volume 8148 of LNCS , 2013
"... ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
Abstract not found

The Design of the Sixth Answer Set Programming Competition – Report –

by Martin Gebser, Marco Maratea, Francesco Ricca
"... Abstract. Answer Set Programming (ASP) is a well-known paradigm of declar-ative programming with roots in logic programming and non-monotonic rea-soning. Similar to other closely-related problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advances in ASP solving are as-sesse ..."
Abstract - Add to MetaCart
Abstract. Answer Set Programming (ASP) is a well-known paradigm of declar-ative programming with roots in logic programming and non-monotonic rea-soning. Similar to other closely-related problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advances in ASP solving are as

The Answer Set Programming (ASP) Competition

by Francesco Calimeri, Giovambattista Ianni, Thomas Krennwallner, Francesco Ricca , 2012
"... is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The competition consists of two main tracks: the ASP System Track and the Model & Solve Track. The traditional System Track compares dedicated answer set solvers on ASP benchmarks, ..."
Abstract - Add to MetaCart
is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The competition consists of two main tracks: the ASP System Track and the Model & Solve Track. The traditional System Track compares dedicated answer set solvers on ASP benchmarks

The termination competition 2006

by Claude Marché, Hans Zantema - In Geser and Sondergaard
"... Abstract. The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades several techniques have been developed to prove termination of programs and rewrite systems. In the late nineties ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades several techniques have been developed to prove termination of programs and rewrite systems. In the late nineties

Under consideration for publication in Theory and Practice of Logic Programming 1 The Design of the Fifth Answer Set Programming Competition

by Francesco Calimeri, Francesco Ricca, Martin Gebser, Marco Maratea , 2003
"... Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and nonmonotonic reasoning. Advances in ASP solving tech-nology are customarily assessed in competition events, as it happens for other closely-related pro ..."
Abstract - Add to MetaCart
Answer Set Programming (ASP) is a well-established paradigm of declarative programming that has been developed in the field of logic programming and nonmonotonic reasoning. Advances in ASP solving tech-nology are customarily assessed in competition events, as it happens for other closely

The Multilingual Question Answering Track at CLEF

by Bernardo Magnini, Danilo Giampiccolo, Lili Aunimo, Christelle Ayache, Petya Osenova, Anselmo Peñas, Maarten De Rijke, Bogdan Sacaleanu, Diana Santos, Richard Sutcliffe
"... This paper presents an overview of the Multilingual Question Answering evaluation campaigns which have been organized at CLEF (Cross Language Evaluation Forum) since 2003. Over the years, the competition has registered a steady increment in the number of participants and languages involved. In fact, ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. This report describes the task in general and, in more detail, the methodology used for preparing the data-sets as well as the resources available for training systems. The approaches and results achieved by participating groups are also briefly discussed. 1.

Improving Answer Set Based Planning

by Peter Baumgartner, Anupam Mediratta
"... Solving AI planning problems by transformation into (normal) logic programs and computing answer sets (stable models) has gained considerable interest over the last years. We investigate in this context a classical AI search technique, bidirectional search, where search is performed both from the in ..."
Abstract - Add to MetaCart
the initial facts towards the goal and vice versa. Our contribution is to show how bidirectional search can be realized in the logic programming/answer set paradigm to planning. This seems not having been investigated so far. We report on practical experiments on planning problems from an AIPS competition

Answer Set Programming for Single-Player Games in General Game Playing

by Michael Thielscher
"... Abstract. As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human intervention. In this paper, we show how Answer Set Programming can assist a general game player with the spe ..."
Abstract - Cited by 14 (5 self) - Add to MetaCart
of the original GDL game. We report on experiments with single-player games from past AAAI General Game Playing Competitions which substantiate the claim that Answer Set Programming can provide valuable support to general game playing systems for this type of games. 1

Answering factoid questions in the biomedical domain

by Dirk Weissenborn, George Tsatsaronis, Michael Schroeder, Technische Universität Dresden - In 1st BioASQ Workshop , 2013
"... Abstract. In this work we present a novel approach towards the extraction of factoid answers to biomedical questions. The approach is based on the combination of structured (ontological) and unstructured (textual) knowledge sources, which enables the system to extract factoid answer candidates out o ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
system to address the automated answering of factoid questions, in the framework of challenge 1b. Preliminary evaluation in the factoid questions of the dry-run set of the competition shows promising results, with a reported average accuracy of 54.66%. 1
Results 1 - 10 of 201