Sciweavers

271 search results - page 15 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
ICFCA
2004
Springer
14 years 1 months ago
Background Knowledge in Concept Graphs
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
Frithjof Dau
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
13 years 9 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
13 years 11 months ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
FORTE
2009
13 years 5 months ago
Epistemic Logic for the Applied Pi Calculus
We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the secur...
Rohit Chadha, Stéphanie Delaune, Steve Krem...