Sciweavers

2529 search results - page 183 / 506
» The Logical Structure of Binding
Sort
View
DATE
1998
IEEE
92views Hardware» more  DATE 1998»
15 years 11 months ago
Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions
Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced vari...
Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya
ECP
1997
Springer
130views Robotics» more  ECP 1997»
15 years 11 months 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
KDD
1995
ACM
112views Data Mining» more  KDD 1995»
15 years 10 months ago
Learning First Order Logic Rules with a Genetic Algorithm
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
Sébastien Augier, Gilles Venturini, Yves Ko...
EUSFLAT
2007
124views Fuzzy Logic» more  EUSFLAT 2007»
15 years 8 months ago
Mixed Integer Programming, General Concept Inclusions and Fuzzy Description Logics
Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. In [23], a solution based on Mixed Integer Linear Progr...
Umberto Straccia, Fernando Bobillo
TCS
2008
15 years 6 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...