Sciweavers

1032 search results - page 21 / 207
» Extended Computation Tree Logic
Sort
View
CEC
2011
IEEE
13 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CADE
1998
Springer
15 years 1 months ago
Rank/Activity: A Canonical Form for Binary Resolution
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
Joseph Douglas Horton, Bruce Spencer
AI
2010
Springer
14 years 9 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...
WOLLIC
2009
Springer
15 years 4 months ago
Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
Katsuhiko Sano
ICCD
2005
IEEE
135views Hardware» more  ICCD 2005»
15 years 6 months ago
Extended Forward Implications and Dual Recurrence Relations to Identify Sequentially Untestable Faults
In this paper, we make two major contributions: First, to enhance Boolean learning, we propose a new class of logic implications called extended forward implications. Using a nove...
Manan Syal, Rajat Arora, Michael S. Hsiao