Sciweavers

365 search results - page 33 / 73
» First-order logical filtering
Sort
View
ENTCS
2006
94views more  ENTCS 2006»
13 years 7 months ago
Reasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
Cliff B. Jones
DIAGRAMS
2006
Springer
13 years 11 months ago
Fixing Shin's Reading Algorithm for Peirce's Existential Graphs
In her book "The Iconic Logic of Peirce's Graphs", S. J. Shin elaborates the diagrammatic logic of Peirce's Existential Graphs. Particularly, she provides trans...
Frithjof Dau
CADE
2008
Springer
14 years 8 months ago
A Small Framework for Proof Checking
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...
Hans de Nivelle, Piotr Witkowski
BIRTHDAY
2010
Springer
13 years 9 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
ACL
1996
13 years 9 months ago
Magic for Filter Optimization in Dynamic Bottom-up Processing
Off-line compilation of logic grammars using Magic allows an incorporation of filtering into the logic underlying the grammar. The explicit definite clause characterization of fil...
Guido Minnen