Sciweavers

3136 search results - page 245 / 628
» Genetic programming theory
Sort
View
JELIA
1990
Springer
15 years 10 months ago
Action Logic and Pure Induction
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
Vaughan R. Pratt
ENTCS
2007
144views more  ENTCS 2007»
15 years 6 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
FCT
2007
Springer
15 years 10 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
AAAI
2010
15 years 8 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou
IJAR
2008
129views more  IJAR 2008»
15 years 6 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...