-------- Original-Nachricht -------- Betreff: [WI] ASPOCP 2014: Call for participation Datum: Tue, 27 May 2014 14:56:44 +0200 Von: Marco Maratea marco@dist.unige.it Antwort an: Marco Maratea marco@dist.unige.it Organisation: DIBRIS - University of Genova An: SIGPLAN-ANNOUNCE@LISTSERV.ACM.ORG, agents@cs.umbc.edu, als+lics-list@inf.ed.ac.uk, CADEinc@cs.albany.edu, cipher-cfp@ieee-security.org, church-announce@csr.bu.edu, caml-announce@inria.fr, colognet@ucy.ac.cy, comp-lang-ml@moderators.isc.org, conferences@computer.org, cs@ics.forth.gr, dl@dl.kr.org, elsnet-list@elsnet.org, formal-methods@cs.toronto.edu, formal-methods@cs.utoronto.ca, inductive-request@listserv.unb.ca, ki-inf@uni-koblenz.de, kr@kr.org, lfcs-interest@dcs.ed.ac.uk, linear-request@cs.stanford.edu, linear@cs.stanford.edu, logic-list@helsinki.fi, logic@cs.stanford.edu, mathgroup@smc.vnet.net, nqthm-users@cs.utexas.edu, nvti-list@cwi.nl, oegai@ifs.tuwien.ac.at, om-announce@openmath.org, petrinet@informatik.uni-hamburg.de, PlanetKR@kr.org, planet@lists.uni-ulm.de, podc-related@acm.org, puml-list@cs.york.ac.uk, theorem-provers@ai.mit.edu, theory-logic@cs.cmu.edu, theory@cl.cam.ac.uk, types-announce-owner@lists.seas.upenn.edu, users-prolog@gnu.org, vki-list@dfki.de, webmaster@aisb.org.uk, wi@aifb.uni-karlsruhe.de, yap-users@lists.sourceforge.net, planetkr@kr.org, event@in.tu-clausthal.de, aixia@aixia.it, gulp-all@yahoogroups.com, tag@utlists.utexas.edu, smt-lib@cs.nyu.edu
[Apologize for multiple posting.]
=============================================================================== CALL FOR PAPERS ASPOCP 2014 7th Workshop on Answer Set Programming and Other Computing Paradigms https://sites.google.com/site/aspocp2014 July 23rd, 2014
Affiliated with the International Conference on Logic Programming 2014 (part of the Federated Logic Conference 2014) Vienna, Austria July 19-22, 2014
Collocated with the Vienna Summer of Logic 2014 Vienna, Austria July 12-24, 2014
===============================================================================
AIMS AND SCOPE Since its introduction in the late 1980s, answer set programming (ASP) has been widely applied to various knowledge-intensive tasks and combinatorial search problems. ASP was found to be closely related to SAT, which has led to a method of computing answer sets using SAT solvers and techniques adapted from SAT. While this has been the most studied relationship which is currently extended towards satisfiability modulo theories (SMT), the relationship of ASP to other computing paradigms, such as constraint satisfaction, quantified boolean formulas (QBF), first-order logic (FOL), or FO(ID) logic is also the subject of active research. New methods of computing answer sets are being developed based on the relation between ASP and other paradigms, such as the use of pseudo-Boolean solvers, QBF solvers, FOL theorem provers, and CLP systems. Furthermore, the practical applications of ASP also foster work on multi-paradigm problem-solving, and in particular language and solver integration. The most prominent examples in this area currently are the integration of ASP with description logics (in the realm of the Semantic Web), constraint satisfaction, and general means of external computation. This workshop will facilitate the discussion about crossing the boundaries of current ASP techniques in theory, solving, and applications, in combination with or inspired by other computing paradigms.
ACCEPTED PAPERS
Gerhard Brewka, James Delgrande, Javier Romero and Torsten Schaub. ``Are Preferences Giving You a Headache?'' - ``Take asprin!''
Michael Gelfond, Patrick Kahl, Richard Watson and Yuanlin Zhang. A Refinement of the Language of Epistemic Specifications
Evgenii Balai and Patrick Kahl. Epistemic Logic Programs with Sorts
Stefania Costantini and Andrea Formisano. Query Answering in Resource-Based Answer Set Semantics
Martin Gebser, Tomi Janhunen and Jussi Rintanen. Declarative Encodings of Acyclicity Properties
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger and Stefan Woltran. Computing Secure Sets in Graphs using Answer Set Programming
Pedro Cabalar and Martín Diéguez. Temporal Stable Models are LTL-representable
Mario Alviano, Carmine Dodaro, Joao Marques-Silva and Francesco Ricca. On the Implementation of Weak Constraints in WASP
Shiqi Zhang, Fangkai Yang, Piyush Khandelwal and Peter Stone. Applying Action Language BC with Hierarchical Domain Abstraction to Mobile Robots
Kostyantyn Shchekotykhin. Interactive Query-based Debugging of ASP Programs
Shahab Tasharrofi and Eugenia Ternovska. Supported Semantics for Modular Systems
Joseph Babb and Joohyung Lee. Action Language BC+: Preliminary Report
Amelia Harrison, Vladimir Lifschitz, David Pearce and Agustín Valverde. Infinitary Equilibrium Logic
Ilias Tachmazidis, Grigoris Antoniou and Wolfgang Faber. Computing Answer Sets for Monadic Logic Programs via MapReduce
(EARLY) REGISTRATION AND LOCAL ARRANGEMENTS
Registration is operated by the VSL 2014 organization. Early registration deadline is June 8th.
For further corresponding information, as well as for travel and accommodation details consult:
WORKSHOP CO-CHAIRS Daniela Inclezan, Miami University, USA Marco Maratea, DIBRIS - University of Genova, Italy
-- Mailing-Liste: wi@aifb.uni-karlsruhe.de Administrator: wi-request@lists.uni-karlsruhe.de Konfiguration: https://www.lists.uni-karlsruhe.de/sympa/info/wi