Results 1  10
of
436,527
Proof search in an authorization logic
, 2009
"... We consider the problem of proof search in an expressive authorization logic that contains a “says ” modality and an ordering on principals. After a description of the proof system for the logic, we identify two fragments that admit complete goaldirected and saturating proof search strategies. A sm ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
We consider the problem of proof search in an expressive authorization logic that contains a “says ” modality and an ordering on principals. After a description of the proof system for the logic, we identify two fragments that admit complete goaldirected and saturating proof search strategies. A
Chapter 4 Proof Search
, 2001
"... Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the formalization of reasoning involving state. It conservatively extends intuitionistic logic and can therefore also serve as the logical basis for general constructive mathematics. Searching for proofs ..."
Abstract
 Add to MetaCart
Linear logic as introduced by Girard and presented in the previous chapter is a rich system for the formalization of reasoning involving state. It conservatively extends intuitionistic logic and can therefore also serve as the logical basis for general constructive mathematics. Searching for proofs
Proof Search in Constructive Logics
 In Sets and proofs
, 1998
"... We present an overview of some sequent calculi organised not for "theoremproving" but for proof search, where the proofs themselves (and the avoidance of known proofs on backtracking) are objects of interest. The main calculus discussed is that of Herbelin [1994] for intuitionistic lo ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We present an overview of some sequent calculi organised not for "theoremproving" but for proof search, where the proofs themselves (and the avoidance of known proofs on backtracking) are objects of interest. The main calculus discussed is that of Herbelin [1994] for intuitionistic
Chapter 4 Proof Search
"... an inference rule with which it might be inferred. We also may need to determine exactly how the conclusion of the rule matches the judgment. For example, in the R rule we need to decide how to split the linear hypotheses between the two premises. After these choices have been made, we reduce the ..."
Abstract
 Add to MetaCart
the goal of deriving the judgment to a number of subgoals, one for each premise of the selected rule. If there are no premises, the subgoal is solved. If there are no subgoals left, we have derived the original judgment. One important observation about bottomup proof search is that some rules
Proofsearch, Satisfiability Modulo Theories
"... banner above paper title A bisimulation between DPLL(T) and a proofsearch strategy for the focused sequent calculus ..."
Abstract
 Add to MetaCart
banner above paper title A bisimulation between DPLL(T) and a proofsearch strategy for the focused sequent calculus
Proof Search in Minimal Logic
, 2000
"... this paper was the necessity to have a guide for our implementation, we have paid particular attention to write at least the parts of the proofs with algorithmic content as clear and complete as possible. The paper is organized as follows. Section 2 defines the pattern unification algorithm, and in ..."
Abstract
 Add to MetaCart
, and in section 3 its correctness and completeness is proved. Section 4 presents the proof search algorithm, and again its correctness and completeness is proved. The final section 5 contains what we have to say about extensions to and 9. 2 The unification algorithm Unif We work in the simply typed calculus
Abstract proof search
 COMPUTERS AND GAMES (CG 2000), VOLUME 2063 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2002
"... In complex games with a large branching factor such as Go, programs usually use highly selective search methods, heuristically expanding just a few plausible moves in each position. As in early Chess programs, these methods have shortcomings, they often neglect good moves or overlook a refutation. ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
In complex games with a large branching factor such as Go, programs usually use highly selective search methods, heuristically expanding just a few plausible moves in each position. As in early Chess programs, these methods have shortcomings, they often neglect good moves or overlook a refutation
Proof Search in the Intuitionistic Sequent Calculus
 11th International Conference on Automated Deduction
, 1991
"... The use of Herbrand functions (more popularly known as Skolemization) plays an important role in classical theorem proving and logic programming. We define a notion of Herbrand functions for the full intuitionistic predicate calculus. The definition is based on the view that the prooftheoretic role ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
but not the classical sequent calculus motivate a generalization of the classical notion of Herbrand functions. Proof search using generalized Herbrand functions also provides a framework for generalizing logic programming to subsets of intuitionistic logic that are larger than Horn clauses. The search procedure
Proof Search in Lax Logic
, 2000
"... This paper describes two new sequent calculi for Lax Logic. One calculus is for proof enumeration for quanti ed Lax Logic, the other calculus is for theorem proving in propositional Lax Logic ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
This paper describes two new sequent calculi for Lax Logic. One calculus is for proof enumeration for quanti ed Lax Logic, the other calculus is for theorem proving in propositional Lax Logic
Results 1  10
of
436,527