1,439 research outputs found
Semantically Constrained Condensed Detachment is Incomplete
No full textIn reporting on the theorem prover SCOTT (Slaney, SCOTT: A Semantically Guided Theorem Prover, Proc. IJCAI, 1993) we suggested semantic constraint as as an appropriate mechanism for guiding proof searches in propositional systems where the rule of inference is condensed detachment---a generalisation of Modus Ponens. Such constrained condensed detachment is closely analogous to semantic resolution. This paper exhibits an example which shows that semantically constrained condensed detachment is incomplete. That is, there are formulae deducible by means of condensed detachment which are not deducible when the semantic constraint is imposed. This answers an open question from our 1993 paper. Semantically Constrained Condensed Detachment is Incomplete John Slaney and Timothy J. Surendonk August 8, 1995 Abstract In reporting on the theorem prover SCOTT (Slaney, SCOTT: A Semantically Guided Theorem Prover, Proc. IJCAI, 1993) we suggested semantic constraint as as an appropriate mechanism f..
Marie Slaney Speaks with John Douglas During Florida Ornithological Society Meeting in Fort Pierce
No full textFrom left to right: Marie Slaney speaks with John Douglas during the spring Florida Ornithological Society meeting held April 21, 2001 at the Pelican Yacht Club in Fort Pierce, Florida.https://digitalcommons.usf.edu/fos_images/2109/thumbnail.jp
Marie Slaney Mingles with Victoria and Peter Merritt and Linda and John Douglas in Fort Myers
No full textMarie Slaney (far left) mingles with Victoria Merritt (second from left), her husband Peter Merritt (third from left), Linda Douglas (second from right), and her husband John Douglas (far right) during the fall Florida Ornithological Society meeting held at Florida Gulf Coast University\u27s Whitaker Hall in Fort Myers, Florida on October 11-13, 2001.https://digitalcommons.usf.edu/fos_images/2864/thumbnail.jp
Alien Registration- Slaney, John J. (Portland, Cumberland County)
No full texthttps://digitalmaine.com/alien_docs/23050/thumbnail.jp
Alien Registration- Slaney, John J. (Portland, Cumberland County)
No full texthttps://digitalmaine.com/alien_docs/23050/thumbnail.jp
Semantically Guiding a First-Order Theorem Prover with a Soft Model
No full textVarious versions of our first-order logic theorem prover SCOTT have been developed over the past decade to employ the concept of semantic guidance for improv-ing the underlying system OTTER by McCune (Slaney, Lusk, & McCune 1994; Hodgson & Slaney 2001; 2002). We introduce our latest attempt to speed up OTTER’s proof search, Softie. While the various SCOTTs consulted an ordinary constraint solver to gain information about the problem to be solved, Softie is implemented from scratch and uses a solver capable of handling soft constraints. The first-order theorem prover OTTER searches for refu-tation proofs by the means of the given clause algorithm, which partitions the clauses of a problem into the usable list (UL) and the set of support (SOS). So-called given clauses are selected from the SOS, moved to the UL, and react un
Phase Transitions And Optimality: Sense And Nonsense
No full textWe study the hardness of finding an optimal plan in the Blocks World (BW). As expected, there is an easy-hard-easy pattern in terms of the length of the solution: problems with short solutions and problems requiring very long plans are both easy to solve optimally. Our investigations relate this phenomenon to a common underlying cause for both medium plan length and hard optimisation problems. We offer some thoughts as to a qualitative explanation of this. Along the way, we consider and dismiss another approach of associating hardness with a phase transition in the probability of the existence of a solution of given length. That approach we consider to be flawed, and we believe that researchers on phase transition phenomena should beware of the trap it opens. Phase Transitions and Optimality: Sense and Nonsense John Slaney and Sylvie Thi'ebaux September 19, 1997 Abstract We study the hardness of finding an optimal plan in the Blocks World (BW). As expected, there is an e..
Scott: Semantically Constrained Otter System Description
No full textThis is the announcement of SCOTT 1.0 from the proceedings of CADE-12. SCOTT combines OTTER and FINDER into a new theorem prover. SCOTT: Semantically Constrained Otter System Description John Slaney 1 , Ewing Lusk 2 and William McCune 2 1 Australian National University, Canberra 0200, Australia 2 Argonne National Laboratory, Argonne, Illinois 60439-4801, USA The theorem prover SCOTT, early work on which was reported in [3], is the result of tying together the existing prover OTTER [1] and the existing model generator FINDER [4] to make a new system of significantly greater power than either of its parents. The functionality of SCOTT is broadly similar to that of OTTER, but its behaviour is sufficiently different that we regard it as a separate system. 1 OTTER We briefly review the algorithm of OTTER, a first order theorem prover embodying the set of support strategy. It chains forward from a set of input clauses until either the search space is exhausted or the empty c..
All NFLD Football Champions 1966
No full textPhotograph of the All NFLD Football Champions 1966. Front Row (L-R) Bob Slaney, Cyril Quirke, Reg Farrell, Gerald Fitzpatrick, Sam Tobin, Keith Walsh, Wils Molloy. Back Row (L-R) Robert Quirke, Len Slaney, Jack Lundrigan (Coach), Norm Kelly, Howard Lake, Brendan Slaney, John Tosney, Carl Ferrie.Taken from a CD marked "Opening of Hospital 1954
An Investigation of Variable Relationships in 3-SAT Problems
No full textTo date, several types of structure for finite Constraint Satisfaction Problems have been investigated with the goal of either improving the performance of problem solvers or allowing efficient problem solvers to be identified. Our aim is to extend the work in this area by performing a structural analysis in terms of variable connectivity for 3-SAT problems. Initially structure is defined in terms of the compactness of variable connectivity for a problem. Using an easily calculable statistic developed to measure this compactness, a test was then created for identifying 3-SAT problems as either compact, loose or unstructured (or uniform). A problem generator was constructed for generating 3-SAT problems with varying degrees of structure. Using problems from this problem generator and existing problems from SATLIB, we investigated the effects of this type of structure on satisfiability and solvability of 3-SAT problems. For the same problem length, it is demonstrated that satisfiability and solvability are different for structured and uniform problems generated by the problem generator
- …
