Sciweavers

4370 search results - page 749 / 874
» Algebra of Logic Programming
Sort
View
120
Voted
KSEM
2007
Springer
15 years 8 months ago
An Argumentative Reasoning Service for Deliberative Agents
Abstract. In this paper we propose a model that allows agents to deliberate using defeasible argumentation, to share knowledge with other agents, and to represent individual knowle...
Alejandro Javier García, Nicolás D. ...
128
Voted
PKDD
2007
Springer
146views Data Mining» more  PKDD 2007»
15 years 8 months ago
A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions
This paper presents a novel method for multi-relational classification via an aggregation-based Inductive Logic Programming (ILP) approach. We extend the classical ILP representati...
Richard Frank, Flavia Moser, Martin Ester
120
Voted
RR
2007
Springer
15 years 8 months ago
Decidability Under the Well-Founded Semantics
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
Natalia Cherchago, Pascal Hitzler, Steffen Hö...
111
Voted
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
15 years 8 months ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
131
Voted
TLCA
2007
Springer
15 years 8 months ago
A Substructural Type System for Delimited Continuations
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
Oleg Kiselyov, Chung-chieh Shan