@inproceedings{cfgirw2013-pai,
author = {Francesco Calimeri and Michael Fink and Stefano Germano and Giovambattista Ianni and Christoph Redl and Anton Wimmer},
booktitle = {National Workshop and Prize on Popularize Artificial Intelligence, Turin, Italy, December 5, 2013},
conference = {http://aixia2013.i-learn.unito.it/},
date = {December 5, 2013},
location = {Turin, Italy},
month = {December},
title = {{AngryHEX:} An Artificial Player for Angry Birds Based on Declarative Knowledge Bases},
year = {2013},
pages = {29--35},
editor = {Matteo Baldoni and Federico Chesani and Paola Mello and Marco Montali}
}
@misc{cfgirw2013-ijcai-angrybirds,
author = {Francesco Calimeri and Michael Fink and Stefano Germano and Giovambattista Ianni and Christoph Redl and Anton Wimmer},
month = {August},
title = {{AngryHEX:} An Angry Birds-playing Agent based on {HEX}-Programs},
year = {2013},
howpublished = {Angry-Birds Competition 2013, August 6-9, 2013, Beijing, China}
}
@inproceedings{ekr2013-inap11,
author = {Thomas Eiter and Thomas Krennwallner and Christoph Redl},
booktitle = {Proceedings of the Nineteenth International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011)},
conference = {http://www.kr.tuwien.ac.at/events/inap11/},
date = {September 28-30, 2011},
date-added = {2012-06-17 07:46:39 +0200},
date-modified = {2013-10-05 15:48:21 +0000},
doi = {10.1007/978-3-642-41524-1_15},
editor = {Hans Tompits},
issn = {978-3-642-41523-4},
keywords = {Answer Set Programming, {HEX}-Programs, Modular Logic Programming},
location = {Vienna},
month = {October},
pages = {1-10},
projectref = {FWF-P20840, FWF-P20841, FWF-P24090, WWTF-ICT08-020},
publisher = {Springer},
series = {LNAI},
title = {{HEX}-Programs with Nested Program Calls},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/inap2011-nestedhex.pdf},
volume = {7773},
year = {2013},
bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/nestedhex-inap11.pdf},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/events/inap11/},
bdsk-url-3 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2012/inap2011-nestedhex.pdf}
}
@techreport{eite-etal-12a,
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl and Peter Sch\"{u}ller},
title = {Improving {HEX}-Program Evaluation based on Unfounded Sets},
year = {2013},
institution = {Institut f{\"u}r Informationssysteme, Technische Universit{\"a}t Wien},
address = {A-1040 Vienna, Austria},
number = {INFSYS RR-1843-12-08},
month = {September}
}
@inproceedings{efkr2013-gttv,
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
booktitle = {Second Workshop on Grounding and Transformations for Theories with Variables (GTTV 2013), Corunna, Spain, September 15, 2013},
conference = {http://gttv13.irlab.org/},
date = {September 15, 2013},
date-added = {2013-08-05 13:28:31 +0000},
date-modified = {2013-09-21 09:56:06 +0000},
editor = {David Pearce and Shahab Tasharrofi and Evgenia Ternovska and Concepci{\'o}n Vidal},
location = {Corunna, Spain},
month = {September},
pages = {3--15},
projectref = {FWF-P20841, FWF-P24090},
title = {Grounding {HEX}-Programs with Expanding Domains},
url = {http://gttv13.irlab.org/sites/10.56.35.200.gttv13/files/gttv13.pdf},
year = {2013},
bdsk-url-1 = {http://lpnmr2013.udc.es/},
bdsk-url-2 = {http://gttv13.irlab.org/}
}
@inproceedings{efkr2013-inap,
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
booktitle = {Proceedings of the Twentieth International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013), Kiel, Germany, September 11-13, 2013},
conference = {http://www.dcc.fc.up.pt/INAP-2013/},
date = {September 11-13, 2013},
date-added = {2013-08-05 13:30:58 +0000},
date-modified = {2013-08-12 12:39:18 +0000},
editor = {Ricardo Rocha},
location = {Kiel, Germany},
month = {September},
projectref = {FWF-P24090},
title = {{HEX}-Programs with Existential Quantification},
year = {2013},
bdsk-url-1 = {http://www.dcc.fc.up.pt/INAP-2013/}
}
@incollection{fgirs2013-lpnmr,
year = {2013},
isbn = {978-3-642-40563-1},
booktitle = {Proceedings of the Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)},
volume = {8148},
series = {Lecture Notes in Computer Science},
editor = {Cabalar, Pedro and Son, TranCao},
doi = {10.1007/978-3-642-40564-8_31},
title = {{ActHEX:} Implementing {HEX} Programs with Action Atoms},
url = {http://dx.doi.org/10.1007/978-3-642-40564-8_31},
publisher = {Springer Berlin Heidelberg},
author = {Fink, Michael and Germano, Stefano and Ianni, Giovambattista and Redl, Christoph and Sch\"{u}ller, Peter},
pages = {317-322}
}
@inproceedings{accddikkopprrssswx2013-lpnmr,
abstract = {Answer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as {SAT} Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, {ASP} systems are compared in the nowadays customary {ASP} Competition. The fourth {ASP} Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard {ASP} language.},
author = {Mario Alviano and Francesco Calimeri and G{\"u}nther Charwat and Minh Dao-Tran and Carmine Dodaro and Giovambattista Ianni and Thomas Krennwallner and Martin Kronegger and Johannes Oetsch and Andreas Pfandler and J{\"o}rg P{\"u}hrer and Christoph Redl and Francesco Ricca and Patrik Schneider and Martin Schwengerer and {Lara Katharina} Spendier and {Johannes Peter} Wallner and Guohui Xiao},
booktitle = {Proceedings of the Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning, Corunna, Spain, September 15-19, 2013},
conference = {http://lpnmr2013.udc.es/},
date = {September 15-19, 2013},
date-added = {2013-06-22 07:21:37 +0000},
date-modified = {2013-07-20 07:59:35 +0000},
editor = {Pedro Cabalar and Tran Cao Son},
keywords = {Benchmark, Competition},
location = {Corunna, Spain},
month = {September},
pages = {42-53},
projectref = {FWF-P20841, FWF-P24090},
publisher = {Springer},
series = {LNCS},
title = {The Fourth Answer Set Programming Competition: Preliminary Report},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-aspcomp.pdf},
volume = {8148},
year = {2013},
bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-aspcomp.pdf},
bdsk-url-2 = {http://lpnmr2013.udc.es/}
}
@inproceedings{cikkprsswx2013-lpnmr,
abstract = {System competitions evaluate solvers and compare state-of-the-art implementations on benchmark sets in a dedicated and controlled computing environment comprising of multiple hosts. An important task for running a competition is the benchmark execution platform that schedules the workload on available benchmark machines, keeps track of failed and finished jobs, and calculates the competition statistics and solver ranking. In this paper we present VCWC, the Versioning Competition Workflow Compiler. This tool takes as input the participating solvers and dedicated benchmark sets and generates a workflow description for executing all necessary (sub-)tasks for generating the final solver rankings and statistics. As jobs may fail during the execution, VCWC supports a gradual refinement of the competition workflow and allows to add or update solvers, instances, benchmarks, or further runs after the machinery has been brought up. We introduce an abstract model for a competition and present the implementation and system architecture for VCWC. Based on this we report how VCWC is used for the Answer Set Programming Competition 2013.
},
author = {G{\"u}nther Charwat and Giovambattista Ianni and Thomas Krennwallner and Martin Kronegger and Andreas Pfandler and Christoph Redl and Martin Schwengerer and Lara Spendier and Johannes Peter Wallner and Guohui Xiao},
booktitle = {Proceedings of the Twelfth ernational Conference on Logic Programming and Nonmonotonic Reasoning, Corunna, Spain, September 15-19, 2013},
conference = {http://lpnmr2013.udc.es/},
date = {September 15-19, 2013},
date-added = {2013-06-06 05:51:35 +0000},
date-modified = {2013-07-20 08:00:31 +0000},
editor = {Pedro Cabalar and Tran Cao Son},
keywords = {Benchmark, Competition},
location = {Corunna, Spain},
month = {September},
pages = {233--238},
projectref = {FWF-P20841, FWF-P24090},
publisher = {Springer},
series = {LNCS},
title = {{VCWC:} A Versioning Competition Workflow Compiler},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-vcwc.pdf},
volume = {8148},
year = {2013},
bdsk-url-1 = {http://lpnmr2013.udc.es/},
bdsk-url-2 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/lpnmr2013-vcwc.pdf}
}
@inproceedings{efkr2013-aaai,
abstract = {Answer set programs with external source access may introduce new constants that are not present in the program, which is known as value invention. As naive value invention leads to programs with infinite grounding and answer sets, syntactic safety criteria are imposed on programs. However, traditional criteria are in many cases unnecessarily strong and limit expressiveness. We present liberal domain-expansion (de-) safe programs, a novel generic class of answer set programs with external source access that has a finite grounding and allows for value invention. De-safe programs use so-called term bounding functions as a parameter for modular instantiation with concrete---e.g., syntactic or semantic or both---safety criteria. This ensures extensibility of the approach in the future. We provide concrete instances of the framework and develop an operator that can be used for computing a finite grounding. Finally, we discuss related notions of safety from the literature, and show that our approach is strictly more expressive.},
author = {Thomas Eiter and Michael Fink and Thomas Krennwallner and Christoph Redl},
booktitle = {Proceedings of the Twenty-Seventh AAAI Conference (AAAI 2013), July 14--18, 2013, Bellevue, Washington, USA},
conference = {https://www.aaai.org/Conferences/AAAI/aaai13.php},
date = {July 14--18, 2013},
date-added = {2013-03-27 06:57:29 +0000},
date-modified = {2013-07-11 04:20:30 +0000},
doi = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6209},
editor = {Marie desJardins and Michael Littman},
keywords = {Answer Set Programming, External source access, Value invention, Safety criteria, Finite grounding},
location = {Bellevue, Washington, USA},
month = {July},
pages = {267--275},
projectref = {FWF-P20840, FWF-P20841, FWF-P24090, WWTF-ICT08-020},
publisher = {AAAI Press},
title = {Liberal Safety for Answer Set Programs with External Sources},
url = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/aaai2013-liberalsafety.pdf},
year = {2013},
bdsk-url-1 = {http://www.kr.tuwien.ac.at/staff/tkren/pub/2013/aaai2013-liberalsafety.pdf},
bdsk-url-2 = {https://www.aaai.org/Conferences/AAAI/aaai13.php}
}
This file was generated by bibtex2html 1.98.