Sciweavers

351 search results - page 18 / 71
» Classical Logic with Partial Functions
Sort
View
LPNMR
1993
Springer
13 years 11 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
PKDD
2007
Springer
146views Data Mining» more  PKDD 2007»
14 years 1 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
TLCA
2007
Springer
14 years 1 months ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
ERLANG
2003
ACM
14 years 18 days ago
ARMISTICE: an experience developing management software with Erlang
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
David Cabrero, Carlos Abalde, Carlos Varela, Laura...
ISPD
1997
ACM
105views Hardware» more  ISPD 1997»
13 years 11 months ago
Regular layout generation of logically optimized datapaths
The inherent distortion of the structural regularity of VLSI datapaths after logic optimization has until now precluded dense regular layouts of optimized datapaths despite their ...
R. X. T. Nijssen, C. A. J. van Eijk