Sciweavers

546 search results - page 32 / 110
» Substructural Operational Semantics as Ordered Logic Program...
Sort
View
IWFM
2000
112views Formal Methods» more  IWFM 2000»
13 years 9 months ago
A Note on the Relationships Between Logic Programs and Neural Networks
Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
Pascal Hitzler, Anthony Karel Seda
LOPSTR
1994
Springer
13 years 11 months ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
FLOPS
2010
Springer
14 years 2 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
PPDP
2009
Springer
14 years 4 days ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
AAAI
2008
13 years 10 months ago
Argument Theory Change Applied to Defeasible Logic Programming
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...
Martín O. Moguillansky, Nicolás D. R...