Accepted Conference Papers

List of Events:

International Conference on Logic Programming (ICLP 2006)
Principles and Practice of Declarative Programming (PPDP 2006)
International Joint Conference on Automated Reasoning (IJCAR 2006)
Formal Methods Symposia (FM 2006)
International Workshop on Description Logics (DL2006)
Principles and Practice of Semantic Web Reasoning (PPSWR 2006)
Workshop on Programming Languages and Analysis for Security (PLAS 2006)
Knowledge Representation and Reasoning (KR 2006)
Automated Planning and Scheduling (ICAPS 2006)

ICLP 2006
International Conference on Logic Programming

Seattle, WA, August 17-20, 2006

http://www.cs.uky.edu/iclp06/

Accepted Papers

Sergio Antoy and Michael Hanus
Overlapping Rules and Logic Variables in Functional Logic Programs

Enrico Pontelli and Tran Son
Justifications for Logic Programs under Answer Set Semantics

Martin Gebser and Torsten Schaub
Tableaux Calculi for Answer Set Programming

Diptikalyan Saha and C.R. Ramakrishan
A Local Algorithm for Incremental Evaluation of Tabled Logic Programs

Maarten van Emden
Compositional Semantics for the Procedural Interpretation of Logic

Luke Evans Simon, Ajay Mallya and Gopal Gupta
Coinductive Logic Programming

Andy King, Lunjin Lu and Samir Genaim
Detecting Determinacy in Logic Programs

Xuan Li, Andy King and Lunjin Lu
Collapsing Closures

Katsumi Inoue and Chiaki Sakama
Generality Relations in Answer Set Programming

Sebastian Brand and Roland H.C. Yap
Propagation = Logic + Control

Gregory James Duck, Sebastian Brand and Peter James Stuckey
ACD Term Rewriting

Jon Sneyers, Tom Schrijvers and Bart Demoen
Memory reuse for CHR

Pedro Cabalar, Sergei Odintsov, David Pearce and Agustin Valverde
Analysing and Extending Well-Founded and Partial Stable Semantics using Partial Equilibrium Logic

Davy Van Nieuwenborgh, Stijn Heymans and Dirk Vermeir
Cooperating Answer Set Programming

Elvira Albert, Puri Arenas, German Puebla and Manuel Hermenegildo
Reduced Certificates for Abstraction-Carrying Code

Johan Wittocx, Joost Vennekens, Maarten Marien, Marc Denecker and Maurice Bruynooghe
Predicate Introduction under Stable and Well-founded Semantics

Luciano Caroprese, Sergio Greco, Cristina Sirangelo and Ester Zumpano
Declarative Semantics of Production Rules for Integrity Maintenance

Remy Haemmerle and Francois Fages
Modules for Prolog Revisited

James Cheney
The Semantics of Nominal Logic Programs

Alberto Pettorossi, Maurizio Proietti and Valerio Senni
Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

APPLICATION PAPERS

Martin Brain, Tom Crick, Marina DeVos and John Fitch
TOAST: Applying Answer Set Programming to Superoptimisation

Susanne Grell, Torsten Schaub and Joachim Selbig
Modelling biological networks by action languages via answer set programming

Petra Schwaiger and Burkhard Freitag
Using Answer Set Programming for the Automatic Compilation of Assessment Tests

C.R. Ramakrishan, IV Ramakrishnan and David Warren
Deductive Spreadsheets using Tabled Logic Programming

Chitta Baral, Saadat Anwar, Juraj Dzifcak and Hiro Takahashi
Macros, macro calls and use of ensembles in modular Answer Set Programming

Luis Quintano and Irene Rodrigues
Using a Logic Programming framework to Control Database Query Dialogues in Natural Language

SPECIAL INTERST PAPER

Peter Szabo and Peter Szeredi
Improving the ISO Prolog standard by analysing compliance test results

POSTERS

Salvador Abreu and Vitor Nogueira
Towards Structured Contexts and Modules

Vitor Nogueira and Salvador Abreu
Temporal Contextual Logic Programming

Hugo Lopez, Catuscia Palamidessi, Jorge A. Perez, Camilo Rueda and Frank D. Valencia
A Declarative Framework for Security: Secure Concurrent Constraint Programming

Claudio Silva, Ricardo Rocha and Ricardo Lopes
An External Module For Implementing Linear Tabling in Prolog

Juan Fernendez Ortiz and Jurgen Villadsen
Natural Language Processing Using Lexical and Logical Combinators

Paulo Jorge Lopes de Moura and Vincent Marchetti
Logtalk processing of STEP Part 21 files

Veronica Dahl and Baohua Gu
Semantic Property Grammars for Knowledge Extraction from Biomedical Text

Hai-Feng Guo, Miao Liu and Bharat Jayaraman
Relaxation on Optimization Predicates

Dulce Aguilar-Solis
Learning Semantic Parsers: a Constraint Handling Rule Approach

Kazunori Ueda, Norio Kato, Koji Hara and Ken Mizuno
LMNtal as a Unifying Declarative Language

Ricardo Rocha
Handling Incomplete and Complete Tables in Tabled Logic Programs

Rafael Caballero Roldan, Mario Rodriguez Artalejo and Rafael del Vado Virseda
Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming

Andrei Mantsivoda, Anton Malykh and Vladimir Lipovchenko
Logic programming in Knowledge Domains

Thi-Bich-Hanh Dao and Khalil Djelloul
Solving First-Order Constraints in the Theory of the Evaluated Trees

Quan Phan and Gerda Janssens
An Algorithm for Region-based Memory Management for Deterministic Mercury Programs

Edna Ruckhaus, Vladimir Kolovski, Bijan Parsia and Bernardo Cuenca
Integrating Datalog with OWL: Exploring the AL-log Approach

Edison Mera, Pedro Lopez-Garcia, German Puebla, Manuel Carro and Manuel Hermenegildo
Combining Static Analysis and Profiling for Estimating Execution Times in Logic Programs

PPDP 2006
Principles and Practice of Declarative Programming

Venice, Italy, July 10-12, 2006

http://www.dsi.unive.it/ppdp2006/

ACCEPTED PAPERS:

Nic Volanschi.
Condate: A Proto-language at the Confluence Between Checking and Compiling

Huu-Duc Nguyen and Atsushi Ohori.
Compiling ML Polymorphism with Explicit Layout Bitmap

Murdoch Gabbay and Aad Mathijssen.
One-and-a-halfth-order logic

Yosihiro Yuse and Atsushi Igarashi.
A Modal Type System for Multi-Level Generating Extensions with Persistent Code

Michael Hanus.
Type-Oriented Construction of Web User Interfaces

Yutaka Matsuno and Atsushi Ohori.
A Type System Equivalent to Static Single Assignment

Tom Schrijvers and Maurice Bruynooghe.
Polymorphic Algebraic Data Type Reconstruction

Coen De Roover, Johan Brichau and Theo D'Hondt.
Combining Fuzzy Logic and Behavioral Similarity for Non-Strict Program
Validation

Martin Sulzmann.
Extracting Programs from Type Class Proofs

Daniele Gorla, Matthew Hennessy and Vladimiro Sassone.
Inferring Dynamic Credentials for Role-based Trust Management

Robin Abraham and Martin Erwig.
Type Inference for Spreadsheets

Andres Loeh and Ralf Hinze.
Open data types and open functions

Dale Miller.
Collection analysis for Horn clause programs

German Puebla and Claudio Ochoa.
Poly-Controlled Partial Deduction

Rachid Echahed, Ricardo Caferra and Nicolas Peltier.
Rewriting Term-Graphs with Priority

Dario Colazzo and Carlo Sartiani.
An Efficient Algorithm for XML Type Projection

Josep Silva and Olaf Chitil.
Combining Algorithmic Debugging and Program Slicing

Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello
and Marco Montali.
An Abductive Framework for A-Priori Verification of Web Services

Tobias Lindahl and Konstantinos Sagonas.
Practical Subtype Inference Based on Success Typings

Maribel Fernandez and Fabien Fleutot.
A Historic Functional and Object-Oriented Calculus

Isabelle GNAEDIG and Helene KIRCHNER.
Computing constructor forms with non terminating rewrite programs

Adriana Compagnoni, Mariangiola Dezani-Ciancaglini and Pablo Garralda.
BASS: Boxed Ambients with Safe Sessions

IJCAR 2006
International Joint Conference on Automated Reasoning

Seattle, WA, August 17-20, 2006

http://ijcar06.uni-koblenz.de/index.html

System descriptions

Allen Van Gelder and Geoff Sutcliffe. Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
Juergen Giesl, Peter Schneider-Kamp and Rene Thiemann. AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
Joe Hendrix, Jose Meseguer and Hitoshi Ohsaki. A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
Predrag Janicic and Pedro Quaresma. System Description: GCLCprover + GeoThms
Steven Obua and Sebastian Skalberg. Importing HOL into Isabelle/HOL
Boontawee Suntisrivaraporn, Franz Baader and Carsten Lutz. CEL---A Practical Reasoner for Life Science Ontologies
Dmitry Tsarkov and Ian Horrocks. FaCT++ Description Logic Reasoner: System Description
Jürgen Zimmer and Serge Autexier. The MathServe Framework for Semantic Reasoning Web Services

Research papers

Peter Baumgartner and Renate A. Schmidt. Improved Bottom-Up Model Generation
Bernhard Beckert and Andre Platzer. Dynamic Logic with Non-rigid Functions
Christoph E. Benzmueller, Chad E. Brown and Michael Kohlhase. Cut- Simulation in Impredicative Logics
Sylvie Boldo. Pitfalls of a full floating-point proof: example on the formal proof of the Veltkamp/Dekker algorithms
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nicolini, Silvio Ranise and Daniele Zucchelli. Decidability and Undecidability Results for Nelson-Oppen and Rewrite-based Decision Procedures
Chad E. Brown. Combining Type Theory and Untyped Set Theory
Amine Chaieb. Verifying mixed real-integer quantifier elimination
Kaustuv Chaudhuri, Frank Pfenning and Greg Price. A logical characterization of forward and backward chaining in the inverse method
Robert Constable and Wojciech Moczydlowski. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics
Stephane Demri and Denis Lugiez. Presburger Modal Logic is Only PSPACE-complete
Roy Dyckhoff, Delia Kesner and Stephane Lengrand. Strong cut- elimination systems for Hudelmaier's depth-bounded sequent calculus for implicational logic
Daniel Dougherty, Kathi Fisler and Shriram Krishnamurthi. Specifying and Reasoning about Dynamic Access Control Policies
Joerg Endrullis, Johannes Waldmann and Hans Zantema. Matrix Interpretations for Proving Termination of Term Rewriting
Grègoire Benjamin and Thèry Laurent. Certifying large prime numbers: a purely functional library for modular arithmetic
Olga Grinchtein, Martin Leucker and Nir Piterman. Inferring Network Invariants Automatically
John Harrison. Towards self-verification of HOL Light
Florent Jacquemard, Michael Rusinowitch and Laurent Vigneron. Tree automata with equality constraints modulo equational theories
Xiang Xue Jia and Jian Zhang. A Powerful Technique to Eliminate Isomorphism in Finite Model
Yevgeny Kazakov and Boris Motik. A Resolution-Based Decision Procedure for SHOIQ
Adam Koprowski and Hans Zantema. Recursive Path Ordering for Infinite Labelled Rewrite Systems
Dexter Kozen, Christoph Kreitz and Eva Richter. Automating Proofs in Category Theory
Alexander Krauss. Partial Recursive Functions in Higher-Order Logic
Shuvendu Lahiri and Madanlal Musuvathi. Solving Sparse Linear Constraints
Jordi Levy, Manfred Schmidt-Schauss and Mateu Villaret. Stratified Context Unification is NP-complete
Assia Mahboubi. Proving formally the implementation of an efficient gcd algorithm for polynomials
Sean McLaughlin. An Interpretation of Isabelle/HOL in HOL Light
Tobias Nipkow and Gertrud Bauer. Flyspeck I: Tame Graphs
Hans de Nivelle and Jia Meng. Geometric Resolution: A Proof Procedure Based on Finite Model Search
Andrei Paskevich. Connection Tableaux with Lazy Paramodulation
Brigitte Pientka. Eliminating redundancy in higher-order unification:a lightweight approach
Florian Rabe. First-Order Logic with Dependent Types
Erik Reeber and Warren A. Hunt, Jr.. A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA)
Viorica Sofronie-Stokkermans. Interpolation in local theory extensions
Volker Sorge, Andreas Meier, Roy McCasland and Simon Colton. The Automatic Construction of Isotopy Invariants
Geoff Sutcliffe, Stephan Schulz, Koen Claessen and Allen Van Gelder. Using the TPTP Language for Writing Derivations and Finite Interpretations
David Toman and Grant Weddell. On Keys and Functional Dependencies as First-class Citizens in Description Logics
Christian Urban and Stefan Berghofer. A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
Daria Walukiewicz-Chrzaszcz and Jacek Chrzaszcz. Consistency and Completeness of Rewriting in the Calculus of Constructions
Benjamin Werner. On the strength of proof-irrelevant type theories
Anna Zamansky and Arnon Avron. Canonical Gentzen-type calculi with (n,k)-ary quantifiers
Roland Zumkeller. Formal Global Optimization with Taylor Models

FM 2006
Formal Methods Symposium

Hamilton, Canada, August 21-27, 2006

http://fm06.mcmaster.ca/

Accepted Papers:

Marc Aiguier, Karim Berkani and Pascale Le Gall. Feature specification and static analysis for interaction resolution
Nuno Amálio, Susan Stepney and Fiona Polack. A Formal Template Language enabling Metaproof
Cyrille Valentin Artho, Armin Biere and Shinichi Honiden. Enforcer -- Efficient Failure Injection
Stefano Bacherini, Alessandro Fantechi, Matteo Tempestini and Niccolň Zingoni. A Story about Formal Methods Adoption by a Railway Signaling Manufacturer
Fabian Bannwart and Peter Müller. Changing Programs Correctly: Refactoring with Specifications
Sandrine Blazy, Zaynah Dargaye and Xavier Leroy. Formal verification of a C compiler front-end
Jewgenij Botaschanjan, Alexander Gruler, Alexander Harhurin, Leonid Kof, Maria Spichkova and David Trachtenherz. Towards Modularized Verification of Distributed Time-Triggered Systems
Raymond Boute. Using Domain-Independent Problems for Introducing Formal Methods
Greg Brunet, Marsha Chechik and Sebastian Uchitel. Properties of Behavioural Model Merging
Alcino Cunha, José Nuno Oliveira and Joost Visser. Type-safe Two-level Data Transformation
Frederic Dadeau, Fabrice Bouquet and Bruno Legeard. Automated Boundary Test Generation from JML Specifications
David Delahaye, Jean-Frédéric Étienne and Véronique Viguié Donzeau-Gouge. Certifying Airport Security Regulations using the Focal Environment
Alastair F. Donaldson and Alice Miller. Exact and Approximate Strategies for Symmetry Reduction in Model Checking
Neil Evans and Michael Butler. A Proposal for Records in Event-B
Angela Freitas and Ana Lucia Caneca Cavalcanti. Automatic translation from Circus to Java
Alexandre Genon, Thierry Massart and Cédric Meuter. Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences is Needed to Model-Check Traces
Peter Hofner, Bernhard Moeller and Ridha Khedri. Feature Algebras
Quang Thuan Huynh and Abhik Roychoudhury. A Memory Model Sensitive Checker for C#
Wendy Johnston, Kirsten Winter, Lionel van den Berg, Paul Strooper and Peter Robinson. Model-based Variable and Transition Orderings for efficient Symbolic Model Checking
Ioannis Kassios. Dynamic Frames: Support for Framing, Dependencies and Sharing without Restrictions
Zarrin Langari and Richard Trefler. Formal Modeling of Communication Protocols By Graph Transformations
Kim G. Larsen, Ulrik Nyman and Andrzej Wasowski. Interface Input/Output Automata
Xin Li, Jim Hoover and Piotr Rudnicki. Towards Automatic Exception Safety Verification
Mass Soldal Lund and Ketil Střlen. A Fully General Operational Semantics for UML 2.0 Sequence Diagrams with Potential and Mandatory Choice
Tim McComb and Graeme Smith. Compositional Class Refinement in Object-Z
Annabelle McIver. Quantitative refinement and model checking for the analysis of probabilistic systems
Wojciech Mostowski. Formal Reasoning about Non-Atomic Java Card Metho ds in Dynamic Logic
José Nuno Oliveira and Cesar Jesus Rodrigues. Pointfree Factorization of Operation Refinement
Viorel Preoteasa. Mechanical Verification of Recursive Procedures Manipulating Pointers using Separation Logic
Gerhard Schellhorn, Holger Grandy, Dominik Haneberg and Wolfgang Reif. The Mondex Challenge: Machine Checked Proofs for an Electronic Purse
Jonathan Schmitt, Alwin Hoffmann, Michael Balser, Wolfgang Reif and Mar Marcos. Interactive Verification of Medical Guidelines
Shinya Umeno and Nancy Lynch. Proving safety properties of an aircraft landing protocol using I/O Automata and the PVS theorem prover: a case study
Marcel Verhoef, Peter Gorm Larsen and Jozef Hooman. Modeling and Validating Distributed Embedded Real-Time Systems with VDM++
Aleksandr Zaks and Amir Pnueli. PSL Model Checking and Run-time Verification via Testers
Pamela Zave. Compositional Binding in Network Domains
Yujun Zheng, Jinquan Wang and Kan Wang. Partially Introducing Formal Methods into Object-Oriented Development: case studies using a metrics-driven approach

DL 2006
International Workshop on Description Logics

The Lake District, UK, May 30-June 1, 2006

http://www.mindswap.org/2006/dl/

Accepted Papers

Long Papers

Birte Glimm, Ian Horrocks and Ulrike Sattler. Conjunctive Query Answering for Description Logics with Transitive Roles
Franz Baader, Carsten Lutz and Boontawee Suntisrivaraporn. Efficient Reasoning in EL+
Hongkai Liu, Carsten Lutz, Maja Milicic and Frank Wolter. DL Actions with GCIs: a Pragmatic Approach
Yanhui Li, Dazhou Kang, Jianjiang Lu and Dazhou Kang. Discrete Tableau Algorithms for FSHI
Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini and Riccardo Rosati. Epistemic first-order queries over description logic knowledge bases
Magdalena Ortiz, Diego Calvanese and Thomas Eiter. Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
Jan Hladik and Rafael Penaloza. PSPACE Automata for Description Logics
Alexander K. Hudek and Grant Weddell. Binary Absorption in Tableaux-Based Reasoning for Description Logics
Alessandro Artale, Carsten Lutz and David Toman. A Description Logic of Change

Short Papers

Dazhou Kang, Baowen Xu, Jianjiang Lu and Yanhui Li. Reasoning for Fuzzy Description Logic with Comparison Expressions
Giorgos Stoilos, Giorgos Stamou and Jeff Pan. Handling Imprecise Knowledge with Fuzzy Description Logic
Chris Mellish and Jeff Pan. Finding Subsumers for Natural Language Presentation
Achille Fokoue, Aaron Kershenbaum and Li Ma. SHIN ABox Reduction
Yu Ding and Volker Haarslev. Tableau Caching for Description Logics with Inverse and Transitive Roles
Ralf Moeller and Volker Haarslev. On the Scalability of Description Logic Instance Retrieval
Ming Zuo and Volker Haarslev. High Performance Absorption Algorithms for Terminological Reasoning
Tom Gardiner, Ian Horrocks and Dmitry Tsarkov. Automated Benchmarking of Description Logic Reasoners
Bernardo Cuenca Grau, Ian Horrocks, Oliver Kutz and Ulrike Sattler. Will my Ontologies Fit Together?
Zsolt Nagy, Gergely Luk�csy and Peter Szeredi. Description logic reasoning using the PTTP approach
Vladimir Kolovski, Bijan Parsia and Evren Sirin. Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
Christian Halaschek-Wiener, Bijan Parsia, Evren Sirin and Aditya Kalyanpur. Description Logic Reasoning for Dynamic ABoxes
Aditya Kalyanpur, Bijan Parsia and Bernardo Cuenca Grau. Beyond Asserted Axioms: Fine-Grain Justifications for OWL-DL Entailments
Evren Sirin and Bijan Parsia. Optimizations for Answering Conjunctive ABox Queries
Shoham Ben-David, Richard Trefler and Grant Weddell. Model checking the basic modalities of CTL with Description Logic
Thomas Kleemann. Towards Mobile Reasoning

Posters

Giorgos Stoilos and Giorgos Stamou. Euclidian Roles in Description Logics
Krzysztof Goczyla, Wojciech Waloszek, Teresa Zawadzka and Michal Zawadzki. Creating Maps of Concepts for DL Ontologies
Alissa Kaplunova, Atila Kaya and Ralf Moeller. Experiences with Load Balancing and Caching for Semantic Web Applications
Ralf M�ller and Sylvia Melzer. How sensor data interpretation could benefit from description logics: A practical case study
Irma Sofia Espinosa Peraldi and Ralf M�ller. Cost-Efficient Web Service compositons for querying processes over reasoning services
Haiyan Che and Jigui Sun. Static Knowledge Representation of Multi-Agent System's Specification by Description Logic
Felix M�ller, Michael Hanselmann, Thorsten Liebig and Olaf Noppens. A Tableaux-based Mobile DL Reasoner - An Experience Report -
Jie Bao, Doina Caragea and Vasant Honavar. On the Semantics of Linking and Importing in Modular Ontologies
Kevin Lee, Thomas Meyer, Jeff Pan and Richard Booth. Computing Maximally Satisfiable Terminologies for the Description Logic ALC with Cyclic Definitions
Evren Sirin and Bijan Parsia. Pellet System Description
Matteo Cristani, Nicoletta Gabrielli and Paolo Torelli. Topological Reasoning in Basic Description
Pablo Fillottrani, Enrico Franconi and Sergio Tessaris. The new ICOM Ontology Editor

PPSWR 2006
Principles and Practice of Semantic Web Reasoning

Budva, Montenegro, June 10-11, 2006

http://rewerse.net/PPSWR06/

Preliminary Program

Saturday, June 10, 2006

    * 9:00-9:15 Opening.
    * 9:15-10:30 Invited Talk: Harold Boley, University of New Brunswick, Canada: The RuleML Family of Web Rule Languages

    * 11:00-12:30 Reasoning I
          o Fabian Suchanek and Peter Baumgartner. Automated Reasoning Support for First-Order Ontologies.
          o Uwe Assmann, Jakob Henriksson and Jan Maluszynski. Combining safe rules and ontologies by interfacing of reasoners.
          o Guilin Qi, Jeff Pan, Weiru Liu and David A. Bell. A stratification-based approach for inconsistency handling in Description Logics.
    * 14:00-15:30 Applications
          o François Bry, Michael Eckert, Paula-Lavinia Patranjan and Inna Romanenko. Realizing Business Processes with ECA Rules: Benefits, Challenges, Limits.
          o Matteo Baldoni, Cristina Baroglio, Alberto Martelli, Viviana Patti and Claudio Schifanella. Interaction Protocols and Capabilities: a preliminary report.
          o Liviu Badea. Semantic Web Reasoning for Analyzing Gene Expression Profiles.

Sunday, June 11, 2006

    * 9:00-10:30 Querying
          o François Bry, Tim Furche and Benedikt Linse. Data Model and Query Constructs for Versatile Web Query Languages: State-of-the-Art and Challenges for Xcerpt.
          o François Bry, Tim Furche and Benedikt Linse. AMaXoS---Abstract Machine for Xcerpt: Architecture and Principles.
          o Wlodzimierz Drabent. Towards more precise typing rules for Xcerpt.
    * 11:00-12:30 Reasoning II
          o Wolfgang May, Franz Schenk and Elke von Lienen. Extending an OWL Web Node with Reactive Behavior.
          o Carlos Viegas Damásio, Anastasia Analyti, Grigoris Antoniou and Gerd Wagner. Open and Closed World Reasoning in the Semantic Web.
          o Carlos A. Hurtado and Alejandro Vaisman. Reasoning with Temporal Constraints in RDF.
    * 14:00-15:30 System Demonstrations
          o Sacha Berger, François Bry, Tim Furche, Benedikt Linse, Andreas Schroeder. Effective and Efficient Data Access in the Versatile Web Query Language Xcerpt.
          o François Bry and Christoph Wieser. Web Queries with Style: Rendering Xcerpt Programs with CSS-NG.
          o Thomas Hornung, Kai Simon and Georg Lausen. Information Gathering in a Dynamic World.
          o Francesca Alessandra Lisi. Practice of Inductive Reasoning on the Semantic Web: A System for Semantic Web Mining.
          o Hans Jürgen Ohlbach. Fuzzy Time Intervals - System Description of the FuTI-Library.
          o Artur Wilk and Wlodzimierz Drabent. A Prototype of a Descriptive Type System for Xcerpt.

    * 16:00-17:30 Reasoning III
          o Kaarel Kaljurand and Norbert E. Fuchs. Bidirectional mapping between OWL DL and Attempto Controlled English.
          o Hans Eric Svensson and Artur Wilk. XML Querying Using Ontological Information.
          o Craig McKenzie, Alun Preece and Peter Gray. Semantic Web Reasoning using a Blackboard System.
    * 17:30 Closing

PLAS 2006
Workshop on Programming Languages and Analysis for Security

Ottawa, Canada, June 10, 2006

http://www.cis.upenn.edu/~stevez/plas06.html

Preliminary Program

8:30 - 9:00	Registration
9:00 - 10:00	Invited Talk David Wagner University of California, Berkeley
10:00 - 11:00	Session I: Authorization and Monitoring Applying Flow-Sensitive CQUAL to Verify MINIX Authorization Check Placement Timothy Fraser, Nick L. Petroni Jr., William A. Arbaugh Certified In-lined Reference Monitoring on .NET Kevin W. Hamlen, Greg Morrisett, Fred B. Schneider
11:00 - 11:30	Break
11:30 - 12:30	Session II: Finding Security Flaws Combining Type-Based Analysis and Model Checking for Finding Counterexamples against Non-Interference Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa Precise Alias Analysis for Static Detection of Web Application Vulnerabilities Nenad Jovanovic, Christopher Kruegel, Engin Kirda
12:30 - 1:30	Lunch
1:30 - 3:00	Session III: Structuring Secure Systems Specifying Distributed Trust Management in LolliMon Jeff Polakow, Christian Skalka A Microkernel Virtual Machine: Building Security with Clear Interfaces Xiaoqi Lu, Scott F. Smith Empirical Relation between Coupling and Attackability in Software Systems: A Case Study on DOS Michael Yanguo Liu, Issa Traore
3:00 - 3:30	Break
3:30 - 5:00	Session IV: Secure Information Flow Trusted Declassification Boniface Hicks, Dave King, Patrick McDaniel, Michael Hicks Refactoring Programs to Secure Information Flows Scott F. Smith, Mark Thober Efficient Type Inference for Secure Information Flow Katia Hristova, Tom Rothamel, Yanhong A. Liu, Scott D. Stoller katia@cs.sunysb.edu
5:00 - 5:15	Break
5:15 - 6:00	Madness Session

KR 2006
Principles of Knowledge Representation and Reasoning
Lake Districti, UK, June 2-5, 2006

http://www.kr.org/KR2006/

Accepted Papers

Semantics for Dynamic Syntactic Epistemic Logics by Thomas Agotnes, Natasha Alechina
Non-deterministic semantics for first-order paraconsistent logics by Arnon Avron, Anna Zamansky
On planning with programs that sense by Jorge Baier, Sheila McIlraith
Lack of simple characterizations for the distance-based revision by Jonathan Ben-Naim
A Theory of Vague Adjectives Grounded in Relevant Observables by Brandon Bennett
Knowledgebase compilation for efficient logical argumentation by Philippe Besnard, Anthony Hunter
Qualitative Temporal Preferences in the Situation Calculus by Meghyn Bienvenu, Christian Fritz, Sheila McIlraith
Expressive Non-Monotonic Description Logics Based on Circumscription by Piero Bonatti, Carsten Lutz, Frank Wolter
Heuristics for Planning with Simple Preferences using Compiled Knowledge by Blai Bonet, Hector Geffner
A Bad Day Surfing is Better than a Good Day Working: How to Revise a Total Preorder by Richard Booth, Thomas Meyer, Ka-Shu Wong
Logical Foundations of Well-Founded Semantics by Pedro Cabalar, Sergei Odintsov, David Pearce
Data Complexity of Query Answering in Description Logics by Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati
Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modelling by Yann Chevaleyre, Ulle Endriss, Jerome Lang
Constrained Argumentation Frameworks by Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis
Representing Policies for Quantified Boolean Formulas by Sylvie Coste-Marquis, Helene Fargier, Jerome Lang, Daniel Le Berre, Pierre Marquis
A tree decomposition algorithm for Conceptual Graph projection by Madalina Croitoru, Ernesto Compatangelo
Modularity and Web Ontologies by Bernardo Cuenca Grau, Bijan Parsia, Evren Sirin, Aditya Kalyanpur
Iterated revision as prioritized merging by James Delgrande, Didier Dubois, Jerome Lang
Qualitative decision making with bipolar information by Didier Dubois, Helene Fargier
Possibilistic handling of uncertain default rules by Florence Dupin de Saint-Cyr, Henri Prade
Replacements in Non-Ground Answer-Set Programming by Thomas Eiter, Michael Fink, Hans Tompits, Patrick Traxler, Stefan Woltran
Actions as Special Cases by Selim Erdoan, Vladimir Lifschitz
Planning with Prioritized Goals by R. Feldmann, G. Brewka
Compiling Qualitative Preferences into Decision-Theoretic Golog Programs by Christian Fritz, Sheila McIlraith
Grounding and the expression of belief by Benoit Gaudou, Andreas Herzig, Dominique Longin
Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics by Silvio Ghilardi, Carsten Lutz, Frank Wolter
Redoing the Foundations of Decision Theory by Joseph Halpern, Larry Blume, David Easley
Shapley Inconsistency Values by Anthony Hunter, Sébastien Konieczny
Semantical considerations for a logic of actions: an imperative manifesto by Victor Jauregui
Probabilistic abduction without priors by Gabriele Kern-Isberner, Didier Dubois, Angelo Gilio
The Even More Irresistible SROIQ by Oliver Kutz, Ian Horrocks, Ulrike Sattler
Foundations for Knowledge-Based Programs using ES by Gerhard Lakemeyer, Jens Claßen
First-Order Loop Formulas for Normal Logic Programs by Fangzhen Lin, Yin Chen, Yisong Wang, Mingyi Zhang
Updating Description Logic ABoxes by Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter
Variable-Strength Conditional Preferences for Matchmaking in Description Logics by Thomas Lukasiewicz, Joerg Schellhase
Definitorially Complete Description Logics by Maarten Marx, Willem Conradi, Balder Ten Cate
Temporalizing Cardinal Directions: From Constraint Satisfaction to Planning by Marco Ragni, Stefan Wölfl
Abductive Visual Perception with Feature Clouds by D. Randell, M. Witkowski
Reasoning About Knowledge of Unawareness by Leandro Rego, Joseph Halpern
DL+log: Tight Integration of Description Logics and Disjunctive Datalog by Riccardo Rosati
An Ordered Theory Resolution Calculus for Hybrid Reasoning in First-order Extensions of DLs by Scott Sanner, Sheila McIlraith
Action, Belief, and Minimal Change by Richard Scherl
On the Limits of Planning over Belief States under Strict Uncertainty by Sardina Sebastian, Hector Levesque, Giuseppe De Giacomo, Yves Lesperance
From Wine to Water: Optimizing Description Logic Reasoning for Nominals by Evren Sirin, Bernardo Cuenca Grau, Bijan Parsia
Query Answering under the Any-World Assumption for Normal Logic Programs by Umberto Straccia
The Features-and-Fluents Semantics for the Fluent Calculus by Michael Thielscher, Thomas Witkowski
On the Completeness of Approximation Based Reasoning and Planning by Son Tran, Tu Phan
Strong and uniform equivalence of nonmonotonic theories - an algebraic approach by Mirek Truszczynski
Propositional DAGs: a New Graph-Based Language for Representing Boolean Functions by Michael Wachter, Rolf Haenni
Computational Properties of Epistemic Logic Programs by Yan Zhang

ICAPS 2006
International Conference on Automated Planning and Scheduling
Lake District, UK, June 6-10, 2006

http://www.kr.org/KR2006/

Accepted Papers

Bounded Branching and Modalities in Non-Deterministic Planning
Blai Bonet
Optimal Rectangle Packing: A Meta-CSP Approach
Michael Moffitt, Martha Pollack
New Complexity Results for Classical Planning Benchmarks
Malte Helmert
Metatheoretic Plan Summarization and Comparison
Karen Myers
Combining Knowledge Compilation and Search for Efficient Conformant Probabilistic Planning
Jinbo Huang
Fast Probabilistic Planning Through Weighted Model Counting
Carmel Domshlak, Joerg Hoffmann
An affectively driven planner for synthetic characters
Ruth Aylett, Joao Dias, Ana Paiva
Safe LTL Assumption-Based Planning
Alexandre Albore, Piergiorgio Bertoli
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
Daniel Bryce, Subbarao Kambhampati, David Smith
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
Chris Beck
Predictive Planning for Supply Chain Management
David Pardoe, Peter Stone
Concurrent Probabilistic Planning in the Graphplan Framework
Iain Little, Sylvie Thiebaux
Optimal Route Planning under Uncertainty
Evdokia Nikolova, Matthew Brand, David Karger
Efficiently handling temporal knowledge in an HTN planner
Luis Castillo, Juan Fdez-Olivares, Oscar Garcia-Perez, Francisco Palao Reinés
Plan Stability: Replanning versus Plan Repair
Maria Fox, Alfonso Gerevini, Derek Long, Ivan Serina
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
Joerg Hoffmann, Carla Gomes, Bart Selman
Friends or Foes? An AI Planning Perspective on Abstraction and Search
Joerg Hoffmann, Ashish Sabharwal, Carmel Domshlak
Feature Evaluation in Mixed-Initiative Systems: An Experimental Approach
Gabriella Cortellessa, Amedeo Cesta
Lemma Reusing for SAT based Planning and Scheduling
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, Koji Iwanuma
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
Matthew Streeter, Stephen Smith
Learning Heuristic Functions from Relaxed Plans
Sungwook Yoon, Alan Fern, Robert Givan
Learning Depth-First Search
Blai Bonet, Hector Geffner
Tractable Optimal Competitive Scheduling
Jeremy Frank, James Crawford, Lina Khatib, Ronen Brafman
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Mark Rogers, Adele Howe, Darrell Whitley
Goal Achievement in Partially Known, Partially Observable Domains
Allen Chang, Eyal Amir
Bringing Users and Planning Technology Together. Experiences in SIADEX
Juan Fdez-Olivares, Luis Castillo, Oscar Garcia-Perez, Francisco Palao Reinés
Scalable Planning for Distributed Stream Processing Systems
Anton Riabov, Zhen Liu
Solving Factored MDPs with Exponential-Family Transition Models
Branislav Kveton, Milos Hauskrecht
On Some Tractable Cases of Logical Filtering
T. K. Satish Kumar, Stuart Russell
Explanation-Based Acquisition of Planning Operators
Geoffrey Levine, Gerald DeJong
Stochastic Over-subscription Planning using Hierarchies of MDPs
Nicolas Meuleau, Ronen Brafman, Emmanuel Benazera
Memory-Efficient Symbolic Heuristic Search
Rune Jensen, Eric Hansen, Simon Richards, Rong Zhou
Incremental Scheduling to Maximize Quality in a Dynamic Environment
Terry Zimmerman, Anthony Gallagher, Stephen Smith