Sciweavers

977 search results - page 117 / 196
» Logic programming with infinite sets
Sort
View
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 4 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
111
Voted
ICALP
2001
Springer
15 years 5 months ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
104
Voted
POPL
2010
ACM
15 years 10 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
101
Voted
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
15 years 4 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent
ATAL
2009
Springer
15 years 7 months ago
Resource allocation with answer-set programming
Multi-agent resource allocation is a growing area of research at the frontier between Economics and Computer Science. Despite the extensive theoretical work and raising number of ...
João Leite, José Júlio Alfere...