Sciweavers

590 search results - page 26 / 118
» From Relational Specifications to Logic Programs
Sort
View
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 1 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...
ECP
1997
Springer
130views Robotics» more  ECP 1997»
14 years 28 days ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
14 years 1 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
ICDAR
2009
IEEE
14 years 3 months ago
Inductive Logic Programming for Symbol Recognition
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
K. C. Santosh, Bart Lamiroy, Jean-Philippe Ropers
SLOGICA
2008
135views more  SLOGICA 2008»
13 years 8 months ago
A Way to Interpret Lukasiewicz Logic and Basic Logic
Fuzzy logics are in most cases based on an ad-hoc decision about the interpretation of the conjunction. If they are useful or not can typically be found out only by testing them wi...
Thomas Vetterlein