Sciweavers

1026 search results - page 9 / 206
» A Methodology for Equational Reasoning
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
Particle Swarm Optimization Based Diophantine Equation Solver
: The paper introduces particle swarm optimization as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solu...
Siby Abraham, Sugata Sanyal, Mukund A. Sanglikar
JUCS
2006
131views more  JUCS 2006»
13 years 7 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
ACMMPC
2000
Springer
236views Mathematics» more  ACMMPC 2000»
13 years 12 months ago
Calculating Functional Programs
Abstract. Functional programs are merely equations; they may be manipulated by straightforward equational reasoning. In particular, one can use this style of reasoning to calculate...
Jeremy Gibbons
ICLP
2001
Springer
14 years 2 days ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
JISE
2006
85views more  JISE 2006»
13 years 7 months ago
A Programming Methodology for Designing Block Recursive Algorithms
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung, ...