Table of Contents

• On modal mu-calculus in S5 and applicationsGiovanna D'Agostino, Giacomo Lenzi. 9-24 [doi]
• MCINTYRE: A Monte Carlo Algorithm for Probabilistic Logic ProgrammingFabrizio Riguzzi. 25-39 [doi]
• Nonmonotonic extensions of low-complexity DLs: complexity results and proof methodsLaura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato. 41-55 [doi]
• An Inductive Logic Programming Approach to Learning Inclusion Axioms in Fuzzy Description LogicsFrancesca A. Lisi, Umberto Straccia. 57-71 [doi]
• On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logicDomenico Cantone, Marianna Nicolosi Asmundo. 73-97 [doi]
• The Birth of a WASP: Preliminary Report on a New ASP SolverCarmine Dodaro, Mario Alviano, Wolfgang Faber, Nicola Leone, Francesco Ricca, Marco Sirianni. 99-113 [doi]
• Testing ASP programs in ASPIDEOnofrio Febbraro, Kristian Reale, Francesco Ricca. 115-129 [doi]
• Complexity of Super-Coherence Problems in Answer Set ProgrammingMario Alviano, Wolfgang Faber, Stefan Woltran. 131-145 [doi]
• Verifying Compliance of Business Processes with Temporal Answer SetsDavide D'Aprile, Laura Giordano, Valentina Gliozzi, Alberto Martelli, Gian Luca Pozzato, Daniele Theseider Dupré. 147-161 [doi]
• The CHR-based Implementation of the SCIFF Abductive SystemMarco Alberti, Marco Gavanelli, Evelina Lamma. 163-177 [doi]
• Controlling Polyvariance for Specialization-based VerificationFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni. 179-197 [doi]
• Finding Partitions of Arguments with Dung's Properties via SCSPsStefano Bistarelli, Paola Campli, Francesco Santini. 199-213 [doi]
• A Tabled Prolog Program for Solving SokobanNeng-Fa Zhou, Agostino Dovier. 215-228 [doi]
• EM over Binary Decision Diagrams for Probabilistic Logic ProgramsElena Bellodi, Fabrizio Riguzzi. 229-243 [doi]
• Synthesizing Concurrent Programs using Answer Set ProgrammingEmanuele De Angelis, Alberto Pettorossi, Maurizio Proietti. 245-259 [doi]
• ProdProc - Product and Production Process Modeling and ConfigurationDario Campagna, Andrea Formisano. 261-279 [doi]
• PrettyCLP: a Light Java Implementation for Teaching CLPAlessio Stalla, Davide Zanucco, Agostino Dovier, Viviana Mascardi. 281-295 [doi]
• A framework for structured knowledge extraction and representation from natural language via deep sentence analysisStefania Costantini, Niva Florio, Alessio Paolucci. 297-310 [doi]
• Logic-based reasoning support for SBVRDmitry Solomakhin, Enrico Franconi, Alessandro Mosca. 311-325 [doi]
• Winning CaRet Games with Modular StrategiesIlaria De Crescenzo, Salvatore La Torre. 327-331 [doi]
• A Note on the Approximation of Mean-Payoff GamesRaffaella Gentilini. 333-340 [doi]
• Coalitional Games with Priced-Resource AgentsDario Della Monica, Margherita Napoli, Mimmo Parente. 341-347 [doi]
• Cyclic pregroups and natural language: a computational algebraic analysisClaudia Casadio, Mehrnoosh Sadrzadeh. 349-363 [doi]
• TERENCE: An Adaptive Learning System for Reasoning about Stories with Poor Comprehenders and their EducatorsTania Di Mascio, Rosella Gennari, Pierpaolo Vittorini. 365-369 [doi]
• Nested Weight Constraints in ASPStefania Costantini, Andrea Formisano. 371-383 [doi]
• The temporal representation and reasoning of complex eventsFrancesco Mele, Antonio Sorgente. 385-399 [doi]
• Solving XCSP problems by using GecodeMassimo Morara, Jacopo Mauro, Maurizio Gabbrielli. 401-405 [doi]
• Formalization and Automated reasoning about a Complex Signalling NetworkAnnamaria Basile, Maria Rosa Felice, Alessandro Provetti. 407-414 [doi]