Sciweavers

3470 search results - page 180 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
LOGCOM
2010
128views more  LOGCOM 2010»
15 years 1 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
GECCO
1999
Springer
15 years 10 months ago
Evolution by Means of Genetic Programming of Analog Circuits that Perform Digital Functions
This paper demonstrates the ability of genetic programming to evolve analog circuits that perform digital functions and mixed analog-digital circuits. The evolved circuits include...
Forrest H. Bennett III, John R. Koza, Martin A. Ke...
AGP
1998
IEEE
15 years 10 months ago
Parsing with Non-Deterministic Functions
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
Rafael Caballero, Francisco Javier López-Fr...
APLAS
2004
ACM
15 years 10 months ago
History Effects and Verification
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher-order programs. The ...
Christian Skalka, Scott F. Smith
TCS
2010
15 years 4 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...