LPAR 2006 Short Papers Proceeding and Schedule

Short paper schedule in printable form (PDF)

[ Monday | Tuesday | Thursday ]


Monday, 13 November

 17 :00  - 17 :10 Judging Granularity for Automated Mathematics Teaching
   Marvin Schiller, Christoph Benzmüller and Ann Van de Veire
 17 :10  - 17 :20 A SAT-based Implementation for RPO Termination
   Elena Annov, Michael Codish, Jürgen Giesl, Peter Schneider-Kamp and René Thiemann
 17 :20  - 17 :30 A Further Step in the Incremental Design Process: Incorporation of an Increment Specification
   Cécile Braunstein and Emmanuelle Encrenaz
 17 :30  - 17 :40 Semantic Labelling for Termination of Combinatory Reduction Systems
   Makoto Hamana
 17 :40  - 17 :50 Yet Another Context-Based Theta-Subsumption for AI Planning
   Steffen Hölldobler and Olga Skvortsova
 17 :50  - 18 :00 A Graph-Based Approach to build Extended Canonizers
   Christelle Scharff and Silvio Ranise

Tuesday, 14 November

 18 :00  - 18 :10 A Semantical Method to Reduce Branching in Tableau Proofs
   Guido Fiorino, Alessandro Avellone and Ugo Moscato
 18 :10  - 18 :20 Folding Architecture Networks Improve the Performance of Otter
   Michael Blanchard, Dawn MacIsaac and Joseph Horton

Thursday, 16 November

 17 :30  - 17 :40 Extra Constraints for the Social Golfers Problem
   Francisco Azevedo and Hau Nguyen
 17 :40  - 17 :50 Optimized CNF Encoding for Sudoku Puzzles
   Gihwon Kwon and Himanshu Jain
 17 :50  - 18 :00 Nondeterminism in Formal Development of Concurrent Programs: A Constructive Approach
   Hassan Haghighi and Seyed-Hassan Mirian-Hosseinabadi


Last modified: Fri Nov 3 12:26:41 CET 2006