Sciweavers

393 search results - page 56 / 79
» Logic Programs with Classical Negation
Sort
View
JACM
2010
137views more  JACM 2010»
13 years 7 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
AIPS
1994
13 years 9 months ago
Using AI Planning Techniques to Automatically Generate Image Processing Procedures
This paper describes work on the Multimission VICARPlanner (MVP) system to automatically construct executable imageprocessing procedures for custom image processing requests for t...
Steve A. Chien
LOPSTR
1997
Springer
14 years 19 days ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
PPDP
2004
Springer
14 years 1 months ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato
FOIKS
2008
Springer
13 years 10 months ago
An Alternative Foundation for DeLP: Defeating Relations and Truth Values
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
Ignacio D. Viglizzo, Fernando A. Tohmé, Gui...