Sciweavers

69 search results - page 1 / 14
» Let's Plan It Deductively!
Sort
View
IJCAI
1997
13 years 6 months ago
Let's Plan It Deductively!
The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
Wolfgang Bibel
ECAI
1992
Springer
13 years 9 months ago
Deductive Planning and Plan Reuse in a Command Language Environment
We introduce a deductive planning system intended to supply intelligent help systems. It consists of a deductive planner and a plan reuse component, providing planning from rst as...
Susanne Biundo, Dietmar Dengler, Jana Koehler
XSYM
2007
Springer
123views Database» more  XSYM 2007»
13 years 11 months ago
Let a Single FLWOR Bloom
To globally optimize execution plans for XQuery expressions, a plan generator must generate and compare plan alternatives. In proven compiler architectures, the unit of plan genera...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
AIPS
1996
13 years 6 months ago
Deduction-Based Refinement Planning
Weintroduce a method of deduction-based refinement planning where prefabricated general solutions are adapted to special problems. Refmementproceeds by stepwise transforming nonco...
Werner Stephan, Susanne Biundo
EUSFLAT
2003
126views Fuzzy Logic» more  EUSFLAT 2003»
13 years 6 months ago
On the complexity of propositional logics with an involutive negation
Let C be the propositional calculus given by a standard SBL-algebra; C  is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C  i...
Zuzana Haniková