Sciweavers

780 search results - page 133 / 156
» Reasoning about sets using redescription mining
Sort
View
111
Voted
CADE
2007
Springer
16 years 29 days ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
104
Voted
IJCAI
2007
15 years 2 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
121
Voted
JIRS
2000
144views more  JIRS 2000»
15 years 13 days ago
An Integrated Approach of Learning, Planning, and Execution
Agents (hardware or software) that act autonomously in an environment have to be able to integrate three basic behaviors: planning, execution, and learning. This integration is man...
Ramón García-Martínez, Daniel...
UC
2009
Springer
15 years 7 months ago
Computing Domains of Attraction for Planar Dynamics
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Daniel S. Graça, Ning Zhong
121
Voted
KR
2004
Springer
15 years 6 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade