Sciweavers

1054 search results - page 149 / 211
» A Logic Language of Granular Computing
Sort
View
LPNMR
2007
Springer
14 years 1 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
FM
2001
Springer
130views Formal Methods» more  FM 2001»
14 years 4 days ago
Towards a Topos Theoretic Foundation for the Irish School of Constructive Mathematics
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
Mícheál Mac an Airchinnigh
ECAIW
1994
Springer
13 years 11 months ago
Representing and Executing Agent-Based Systems
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...
Michael Fisher
ICCBR
2009
Springer
13 years 5 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
From Machine Learning to Machine Reasoning
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
Léon Bottou