Sciweavers

3319 search results - page 351 / 664
» Subshifts, Languages and Logic
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 7 months ago
Model-Driven Constraint Programming
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
Raphaël Chenouard, Laurent Granvilliers, Rica...
ACL2
2006
ACM
16 years 24 days ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber
LPKR
1997
Springer
15 years 11 months ago
Reasoning with Prioritized Defaults
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
Michael Gelfond, Tran Cao Son
PLILP
1994
Springer
15 years 11 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
220
Voted
AIIA
1995
Springer
15 years 10 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung