TheoryandPracticeofGeometricLogic.pptVIP

Theory and Practice of Coherent Logic (extended overview) Marc Bezem University of Bergen CL as a fragment of FOL Coherent formula: C = D, where C = A1 /\ …/\ An (n≥0, Ai atoms) and D = E1 \/ …\/ Em (m≥0), where each Ej = (∑ x1 …xk ) Cj (k≥0 may vary with j, each Cj a conjunction of atoms) No function symbols (yet), only constants Coherent theory = set of coherent formulas Examples Lattices (meet is associative, Horn clause, ternary relation): x∩y=u /\ u∩z=v /\ y∩z=w = x∩w=u Projective unicity (resolution clause): p|l /\ p|m /\ q|l /\ q|m = p=q \/ l=m Diamond property (coherent clause): a →b /\ a→c = (∑ d) (b→d /\ c→d) In general: A1 /\ ... /\ An = ((∑ x) A11 /\ .../\ A1i) \/ ... \/ ((∑ y) Ak1 /\ ... /\ Akj) Rationale Horn clauses: DCG and Prolog Resolution: ATP coherent logic: ATP and ? Why skolemize, e.g., p(x,y) = (∑z) p(x,z) ? Direct proofs Constructive logic Natural proof theory/objects Inductive definition of X├(T) D (base) X |- D if X |= D (step) X,C1 |- D, … , X,Cn |- D (℅) X |- D X a finite set of facts (= closed atoms) D closed coherent disjunction (parameters in D must occur in X) X |= D iff D = ... \/ (∑ x) C \/ … and X contains all facts in C[x:=a], for some disjunct in D and for suitable parameters a (℅) there exists a closed instance C0=D0 of an axiom in T with C0 included in X (X contains all facts in C0) and D0 = …\/ (∑ x) Ci \/…, each Ci a fresh instance of Ci (1≤i≤n) Examples of derivations T={true=p, p=q}, ? |- q T={p\/q, p=r, q=r}, ? |- r T={p, p=q, q=false}, ? |- r T={(∑ x)p(x), p(x)=q}, ? |- q T={s(a,b), s(x,y)=(∑ z) s(y,z)}, ? |- (∑ x y)(s(a,x)/\s(x,y)) Forward ground reasoning! Metaproperties Soundness