Sciweavers

662 search results - page 34 / 133
» Logic Programming with Ordered Disjunction
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
14 years 23 days ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean
ILP
2000
Springer
13 years 11 months ago
Learning First Order Logic Time Series Classifiers
A method for learning multivariate time series classifiers by inductive logic programming is presented. Two types of background predicate that are suited for this task are introduc...
Juan José Rodríguez, Carlos J. Alons...
PODS
1995
ACM
139views Database» more  PODS 1995»
13 years 11 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
CSL
2009
Springer
14 years 2 months ago
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...