TITLE: ``Logic Programming with Constraints and Priorities''

ABSTRACT:

Take a definite logic program LP, a set of integrity constraints IC, which may or may not be satisfied by LP, and a set of priorities, P, among some of the statements in LP. We provide a semantics and a proof procedure for LP + IC + P such that the proof procedure is sound and complete with respect to the semantics. We show the connections between stable model semantics, Clarke completion and our semantics.

The above described logic can be used to integrate information from different sources, combine knowledge bases, model user preferences and constraints on a database, and provide a query procedure for a multidatabase system which guarantees that the answers provided are consistent, both explicitly and implicitly.

Everyone is welcome to attend.

Web Accessibility