A Formalisation of Propositional Reasoning

Martin Brain

(University of Bath)

This talk presents a formalism for describing the process of reasoning about propositional models, as performed by tools such as ASP, SAT and CSP solvers. Unlike previous formalisms we start by describing the space over which the search is performed and thus produce implementation independent metrics of problem difficulty. These are then used to show that particular problem decomposition techniques successfully target the most difficult parts of the problem.

This is a 'work in progress' talk and as such will be somewhat informal and speculative. The key aim is to identify relations to existing logics and algebraic models.
Thursday 23rd April 2009, 14:00
Digital Technium, Room 05 (Access Grid Room) - Joint Seminar with Bath University
Department of Computer Science