Disjunction and modular goal-directed proof search

Details Disjunction and modular goal-directed proof search Disjunction and modular goal-directed proof search

2001-04-30

arxiv.org/abs/cs/0104021v2

Computer Science

Logic in Computer Science

Scientific paper

This paper explores goal-directed proof search in first-order multi-modal logic. The key issue is to design a proof system that respects the modularity and locality of assumptions of many modal logics. By forcing ambiguities to be considered independently, modular disjunctions in particular can be used to construct efficiently executable specifications in reasoning tasks involving partial information that otherwise might require prohibitive search. To achieve this behavior requires prior proof-theoretic justifications of logic programming to be extended, strengthened, and combined with proof-theoretic analyses of modal deduction in a novel way.

Affiliated with

Also associated with

No associations

Rating

Disjunction and modular goal-directed proof search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Disjunction and modular goal-directed proof search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Disjunction and modular goal-directed proof search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-287777