by Editors • • Comments Off on ICLP 2010: Accepted papers
Robert Brummayer and Matti Järvisalo. Testing and Debugging Techniques for Answer Set Solver Development
Henning Christiansen, Christian Theil Have, Ole Torp Lassen and Matthieu Petit. Inference with Constrained Hidden Markov Models in PRISM
Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir and Martine De Cock. Communicating Answer Set Programs
Christian Drescher and Toby Walsh. A Translational Approach to Constraint Answer Set Solving
Paulo Shakarian, V.S. Subrahmanian and Maria Luisa Sapino. Using Generalized Annotated Programs to Solve Social Network Optimization Problems
Sabrina Baselice and Piero Bonatti. Decidable subclasses of finitary programs
Hariolf Betz, Frank Raiser and Thom Fruehwirth. A Complete and Terminating Execution Model for Constraint Handling Rules
Jose Santos and Stephen Muggleton. Can theta-subsumption be efficiently implemented in Prolog?
Yisong Wang, Jia-Huai You, Li-Yan Yuan and Yi-Dong Shen. Loop Formulas for Description Logic Programs
Peter Schneider-Kamp, Jürgen Giesl, Thomas Stroeder, Alexander Serebrenik and René Thiemann. Automated Termination Analysis for Logic Programs with Cut
Mario Rodríguez-Artalejo and Carlos A. Romero-Díaz. A Declarative Semantics for CLP with Qualification and Proximity
Mario Alviano, Wolfgang Faber and Nicola Leone. Disjunctive ASP with Functions: Decidable Queries and Effective Computation
Domenico Corapi, Alessandra Russo and Emil Lupu. Inductive Logic Programming as Abductive Search
Alessandro Dal Palu, Agostino Dovier, Federico Fogolari and Enrico Pontelli. CLP-based protein fragment assembly
Michela Milano, Marco Gavanelli, Fabrizio Riguzzi and Paolo Cagnoli. Logic-Based Decision Support for Strategic Environmental Assessment
Theofrastos Mantadelis and Gerda Janssens. Dedicated Tabling for a Probabilistic Setting
Marco Alberti, Marco Gavanelli and Evelina Lamma. Runtime Addition of Integrity Constraints in Abductive Logic Programs
Alberto Pettorossi, Maurizio Proietti and Valerio Senni. Transformations of Logic Programs on Infinite Lists
Christoph Wernhard. Circumscription and Projection as Atoms of Logic Programming
Maurizio Gabbrielli, Jacopo Mauro, Maria Chiara Meo and Jon Sneyers. Decidability properties for fragments of CHR
Marcello Balduccini and Sara Girotto. Formalization of Psychological Knowledge in Answer Set Programming and its Application
Daan Fierens. Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Fabrizio Riguzzi and Terrance Swift. Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Jon Sneyers, Wannes Meert, Joost Vennekens, Yoshitaka Kameya and Taisuke Sato. CHR(PRISM)-based Probabilistic Logic Learning
Nicolas Guenot. Focused Proof Search for Linear Logic in the Calculus of Structures
Gerardo Simari and V.S. Subrahmanian. Abductive Inference in Probabilistic Logic Programs
Zachary Snow, David Baelde and Gopalan Nadathur. A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Timur Fayruzov, Jeroen Janssen, Martine De Cock, Chris Cornelis and Dirk Vermeir. Efficient solving of time-dependent answer set programs
Joseph Near. From Relational Specifications to Logic Programs
Martin Slota and João Leite. Towards Closed World Reasoning in Dynamic Open Worlds
Johannes Oetsch, Joerg Puehrer and Hans Tompits. Catching the Ouroboros: On Debugging Non-ground Answer-Set Programs
Johannes Oetsch, Joerg Puehrer, Martin Schwengerer and Hans Tompits. The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs
Johannes Oetsch, Joerg Puehrer and Hans Tompits. Methods and Methodologies for Developing Answer-Set Programs—Project Description
Ping Hou, Broes De Cat and Marc Denecker. FO(FD): Extending classical logic with rule-based fixpoint definitions
Marcello Balduccini. Learning Domain-Specific Heuristics for Answer Set Solvers
Stefan Brass. Implementation Alternatives for Bottom-Up Evaluation
Selen Basol, Ozan Erdem, Michael Fink and Giovambattista Ianni. HEX Programs with Action Atoms
Luis Moniz Pereira and Alexandre Miguel Pinto. Tight Semantics for Logic Programs
Nuno P. Lopes, Juan Navarro Perez, Andrey Rybalchenko and Atul Singh. Applying Prolog to Develop Distributed Systems
Vítor Santos Costa, Inês Castro Dutra and Ricardo Rocha. Threads and Or-Parallelism Unified
António Porto. A Structural Alternative to Prolog with Simple Compositional Semantics
Miguel Gomez-Zamalloa, Elvira Albert and German Puebla. Test Case Generation for Object-Oriented Imperative Languages in CLP
Gregory Gelfond, Chitta Baral, Enrico Pontelli and Tran Son. Using Logic Programming for Finding Models in the Logics of Knowledge and its Applications
Pablo Chico de Guzmán, Manuel Carro Liñares and David S. Warren. Swapping Evaluation: A Memory-Scalable Solution for Answer-On-Demand Tabling
neda saeedloei and Gopal Gupta. Timed Definite Clause Omega-Grammars
Tomi Janhunen. Sampler Programs: The Stable Model Semantics Abstract Constraint Programs Revisited
Pedro Lopez-Garcia, Luthfi Darmawan and Francisco Bueno. A Framework for Verification and Debugging of Resource Usage Properties
James Delgrande. A Program-Level Approach to Revising Logic Programs under the Answer Set Semantics
Michael Maher. Contractible Approximations of Soft Global Constraints
