


default search action
28th ICLP 2012: Budapest, Hungary
- Agostino Dovier, Vítor Santos Costa:

Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, September 4-8, 2012, Budapest, Hungary. LIPIcs 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-43-9
The regular papers of this conference are published in Theory and Practice of Logic Programming, Volume 12 (4-5)
- Frontmatter, Table of Contents, List of Authors.

- Agostino Dovier

, Vítor Santos Costa
:
Introduction to the Technical Communications of the 28th International Conference on Logic Programming Special Issue. - François Bry

, Sebastian Schaffert:
Simulation Unification: Beyond Querying Semistructured Data (Invited Talk). 1-13 - Hendrik Blockeel

, Bart Bogaerts
, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker
, Anthony Labarre
, Jan Ramon, Sicco Verwer:
Modeling Machine Learning and Data Mining Problems with FO(·). 14-25 - Chitta Baral, Nguyen Ha Vo, Shanshan Liang:

Answering Why and How questions with respect to a frame-based knowledge base: a preliminary report. 26-36 - Marco Maratea, Luca Pulina

, Francesco Ricca:
Applying Machine Learning Techniques to ASP Solving. 37-48 - Marcello Balduccini:

An Answer Set Solver for non-Herbrand Programs: Progress Report. 49-60 - Joohyung Lee, Yunsong Meng:

Stable Models of Formulas with Generalized Quantifiers (Preliminary Report). 61-71 - Florian Schanda, Martin Brain:

Using Answer Set Programming in the Development of Verified Software. 72-85 - Mutsunori Banbara, Naoyuki Tamura

, Katsumi Inoue
:
Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. 86-97 - Elvira Albert, Puri Arenas, Miguel Gómez-Zamalloa

:
Towards Testing Concurrent Objects in CLP. 98-108 - Slim Abdennadher, Nada Sharaf:

Visualization of CHR through Source-to-Source Transformation. 109-118 - Zsolt Zombori, János Csorba, Péter Szeredi:

Static Type Inference for the Q language using Constraint Logic Programming. 119-129 - Michael Hanus

:
Improving Lazy Non-Deterministic Computations by Demand Analysis. 130-143 - Giovanni Bacci, Marco Comini

, Marco A. Feliú
, Alicia Villanueva
:
The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages. 144-153 - Rafael del Vado Vírseda, Fernando Pérez Morente, Marcos Miguel García Toledo:

A Concurrent Operational Semantics for Constraint Functional Logic Programming. 154-163 - Bryan Silverthorn, Yuliya Lierler, Marius Schneider

:
Surviving Solver Sensitivity: An ASP Practitioner's Guide. 164-175 - Holger H. Hoos, Roland Kaminski, Torsten Schaub

, Marius Schneider
:
aspeed: ASP-based Solver Scheduling. 176-187 - Christian Drescher, Toby Walsh:

Answer Set Solving with Lazy Nogood Generation. 188-200 - Broes De Cat, Marc Denecker

, Peter J. Stuckey:
Lazy Model Expansion by Incremental Grounding. 201-211 - Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, Torsten Schaub:

Unsatisfiability-based optimization in clasp. 211-221 - Johannes Oetsch

, Jörg Pührer, Hans Tompits:
An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. 222-234 - Jia-Huai You, John Morris, Yi Bi:

Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs. 235-246 - Michael Morak, Stefan Woltran:

Preprocessing of Complex Non-Ground Rules in Answer Set Programming. 247-258 - Vladimir Lifschitz:

Two-Valued Logic Programs. 259-266 - Juan Carlos Nieves, Helena Lindgren

:
Possibilistic Nested Logic Programs. 267-276 - Marc Denecker

, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens
:
A Tarskian Informal Semantics for Answer Set Programming. 277-289 - Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, Concepción Vidal

:
Paving the Way for Temporal Grounding. 290-300 - Wlodzimierz Drabent:

Logic + control: An example. 301-311 - Paul Tarau:

Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection. 312-322 - Sergio Greco

, Francesca Spezzano
, Irina Trubitsyna
:
On the Termination of Logic Programs with Function Symbols. 323-333 - Emilio Jesús Gallego Arias, James Lipton:

Logic Programming in Tabular Allegories. 334-347 - Taisuke Sato

, Philipp J. Meyer
:
Tabling for infinite probability computation. 348-358 - Tiep Le, Hieu Nguyen, Enrico Pontelli

, Tran Cao Son:
ASP at Work: An ASP Implementation of PhyloWS. 359-369 - Verónica Dahl, Bradley Coleman, J. Emilio Miralles, Erez Maharshak:

CHR for Social Responsibility. 370-380 - Nuno Lopes

, Sabrina Kirrane, Antoine Zimmermann
, Axel Polleres
, Alessandra Mileo:
A Logic Programming approach for Access Control over RDF. 381-392 - Viviana Novelli

, Marina De Vos
, Julian A. Padget
, Dina D'Ayala
:
LOG-IDEAH: ASP for Architectonic Asset Preservation. 393-403 - Xiaoping Chen, Guoqiang Jin, Fangkai Yang:

Extending C+ with Composite Actions for Robotic Task Planning. 404-414 - Massimiliano Cattafi, Rosa Herrero

, Marco Gavanelli
, Maddalena Nonato
, Federico Malucelli
:
Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit. 415-424 - Nathaniel Wesley Filardo

, Jason Eisner:
A Flexible Solver for Finite Arithmetic Circuits. 425-438 - Emanuele De Angelis

:
Software Model Checking by Program Specialization. 439-444 - Martín Diéguez:

Temporal Answer Set Programming. 445-450 - Spyros Hadjichristodoulou:

A Gradual Polymorphic Type System with Subtyping for Prolog. 451-457 - Max Ostrowski:

ASP modulo CSP: The clingcon system. 458-463 - Andrea Peano:

An ASP Approach for the Optimal Placement of the Isolation Valves in a Water Distribution System. 464-468 - Christoph Redl:

Answer Set Programming with External Sources. 469-475 - Ben Wright:

Together, Is Anything Possible? A Look at Collective Commitments for Agents. 476-480

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














