Sciweavers

1716 search results - page 131 / 344
» Proving Conditional Termination
Sort
View
PLILP
1993
Springer
14 years 1 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
14 years 28 days ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
CEAS
2006
Springer
14 years 20 days ago
Using E-Mail Social Network Analysis for Detecting Unauthorized Accounts
In this paper we detail the use of e-mail social network analysis for the detection of security policy violations on computer systems. We begin by formalizing basic policies that ...
Adam J. O'Donnell, Walter C. Mankowski, Jeff Abrah...
EMSOFT
2006
Springer
14 years 18 days ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
ICLP
1991
Springer
14 years 13 days ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...