Sciweavers

4370 search results - page 52 / 874
» Algebra of Logic Programming
Sort
View
ICALP
1997
Springer
14 years 1 months ago
Axiomatizations for the Perpetual Loop in Process Algebra
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...
Wan Fokkink
ECAI
2006
Springer
14 years 17 days ago
On the Existence of Answer Sets in Normal Extended Logic Programs
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...
Martin Caminada, Chiaki Sakama
ENTCS
2006
114views more  ENTCS 2006»
13 years 9 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
13 years 10 months ago
Genetic programming for finite algebras
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
Lee Spector, David M. Clark, Ian Lindsay, Bradford...
JUCS
2006
93views more  JUCS 2006»
13 years 8 months ago
Generic Process Algebra: A Programming Challenge
: Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application ...
Paula R. Ribeiro, Marco Antonio Barbosa, Luí...