Sciweavers

1487 search results - page 148 / 298
» Two Kinds of Metonymy
Sort
View
APWEB
2011
Springer
13 years 4 months ago
A Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang
EJC
2010
13 years 9 months ago
On loop identities that can be obtained by a nuclear identification
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
Ales Drápal, Premysl Jedlicka
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
SIGSOFT
2006
ACM
14 years 10 months ago
Questions programmers ask during software evolution tasks
Though many tools are available to help programmers working on change tasks, and several studies have been conducted to understand how programmers comprehend systems, little is kn...
Jonathan Sillito, Gail C. Murphy, Kris De Volder
SIGMOD
2009
ACM
136views Database» more  SIGMOD 2009»
14 years 9 months ago
A comparison of approaches to large-scale data analysis
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
Andrew Pavlo, Erik Paulson, Alexander Rasin, Danie...