Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,305 | Towards an Intelligent Database System Founded on the SP Theory of
Computing and Cognition | cs.DB | The SP theory of computing and cognition, described in previous publications,
is an attractive model for intelligent databases because it provides a simple
but versatile format for different kinds of knowledge, it has capabilities in
artificial intelligence, and it can also function like established database
models whe... | computer science |
35,306 | Turning CARTwheels: An Alternating Algorithm for Mining Redescriptions | cs.CE | We present an unusual algorithm involving classification trees where two
trees are grown in opposite directions so that they are matched at their
leaves. This approach finds application in a new data mining task we formulate,
called "redescription mining". A redescription is a shift-of-vocabulary, or a
different way of... | computer science |
35,307 | A Situation Calculus-based Approach To Model Ubiquitous Information
Services | cs.AI | This paper presents an augmented situation calculus-based approach to model
autonomous computing paradigm in ubiquitous information services. To make it
practical for commercial development and easier to support autonomous paradigm
imposed by ubiquitous information services, we made improvements based on
Reiter's stand... | computer science |
35,308 | Soft Constraint Programming to Analysing Security Protocols | cs.CR | Security protocols stipulate how the remote principals of a computer network
should interact in order to obtain specific security goals. The crucial goals
of confidentiality and authentication may be achieved in various forms, each of
different strength. Using soft (rather than crisp) constraints, we develop a
uniform ... | computer science |
35,309 | Speedup of Logic Programs by Binarization and Partial Deduction | cs.PL | Binary logic programs can be obtained from ordinary logic programs by a
binarizing transformation. In most cases, binary programs obtained this way are
less efficient than the original programs. (Demoen, 1992) showed an interesting
example of a logic program whose computational behaviour was improved when it
was transf... | computer science |
35,310 | Minimal founded semantics for disjunctive logic programs and deductive
databases | cs.LO | In this paper, we propose a variant of stable model semantics for disjunctive
logic programming and deductive databases. The semantics, called minimal
founded, generalizes stable model semantics for normal (i.e. non disjunctive)
programs but differs from disjunctive stable model semantics (the extension of
stable model... | computer science |
35,311 | Strong Equivalence Made Easy: Nested Expressions and Weight Constraints | cs.LO | Logic programs P and Q are strongly equivalent if, given any program R,
programs P union R and Q union R are equivalent (that is, have the same answer
sets). Strong equivalence is convenient for the study of equivalent
transformations of logic programs: one can prove that a local change is correct
without considering t... | computer science |
35,312 | What Causes a System to Satisfy a Specification? | cs.LO | Even when a system is proven to be correct with respect to a specification,
there is still a question of how complete the specification is, and whether it
really covers all the behaviors of the system. Coverage metrics attempt to
check which parts of a system are actually relevant for the verification
process to succee... | computer science |
35,313 | Characterizing and Reasoning about Probabilistic and Non-Probabilistic
Expectation | cs.AI | Expectation is a central notion in probability theory. The notion of
expectation also makes sense for other notions of uncertainty. We introduce a
propositional logic for reasoning about expectation, where the semantics
depends on the underlying representation of uncertainty. We give sound and
complete axiomatizations ... | computer science |
35,314 | Responsibility and blame: a structural-model approach | cs.AI | Causality is typically treated an all-or-nothing concept; either A is a cause
of B or it is not. We extend the definition of causality introduced by Halpern
and Pearl [2001] to take into account the degree of responsibility of A for B.
For example, if someone wins an election 11--0, then each person who votes for
him i... | computer science |
35,315 | Greedy Algorithms in Datalog | cs.DB | In the design of algorithms, the greedy paradigm provides a powerful tool for
solving efficiently classical computational problems, within the framework of
procedural languages. However, expressing these algorithms within the
declarative framework of logic-based languages has proven a difficult research
challenge. In t... | computer science |
35,316 | Representation Dependence in Probabilistic Inference | cs.AI | Non-deductive reasoning systems are often {\em representation dependent}:
representing the same situation in two different ways may cause such a system
to return two different answers. Some have viewed this as a significant
problem. For example, the principle of maximum entropy has been subjected to
much criticism due ... | computer science |
35,317 | Abduction in Well-Founded Semantics and Generalized Stable Models | cs.LO | Abductive logic programming offers a formalism to declaratively express and
solve problems in areas such as diagnosis, planning, belief revision and
hypothetical reasoning. Tabled logic programming offers a computational
mechanism that provides a level of declarativity superior to that of Prolog,
and which has supporte... | computer science |
35,318 | Polyhierarchical Classifications Induced by Criteria Polyhierarchies,
and Taxonomy Algebra | cs.AI | A new approach to the construction of general persistent polyhierarchical
classifications is proposed. It is based on implicit description of category
polyhierarchy by a generating polyhierarchy of classification criteria.
Similarly to existing approaches, the classification categories are defined by
logical functions ... | computer science |
35,319 | Corollaries on the fixpoint completion: studying the stable semantics by
means of the Clark completion | cs.AI | The fixpoint completion fix(P) of a normal logic program P is a program
transformation such that the stable models of P are exactly the models of the
Clark completion of fix(P). This is well-known and was studied by Dung and
Kanchanasut (1989). The correspondence, however, goes much further: The
Gelfond-Lifschitz opera... | computer science |
35,320 | The Munich Rent Advisor: A Success for Logic Programming on the Internet | cs.AI | Most cities in Germany regularly publish a booklet called the {\em
Mietspiegel}. It basically contains a verbal description of an expert system.
It allows the calculation of the estimated fair rent for a flat. By hand, one
may need a weekend to do so. With our computerized version, the {\em Munich
Rent Advisor}, the us... | computer science |
35,321 | The Complexity of Modified Instances | cs.CC | In this paper we study the complexity of solving a problem when a solution of
a similar instance is known. This problem is relevant whenever instances may
change from time to time, and known solutions may not remain valid after the
change. We consider two scenarios: in the first one, what is known is only a
solution of... | computer science |
35,322 | Evolving a Stigmergic Self-Organized Data-Mining | cs.AI | Self-organizing complex systems typically are comprised of a large number of
frequently similar components or events. Through their process, a pattern at
the global-level of a system emerges solely from numerous interactions among
the lower-level components of the system. Moreover, the rules specifying
interactions amo... | computer science |
35,323 | Demolishing Searle's Chinese Room | cs.AI | Searle's Chinese Room argument is refuted by showing that he has actually
given two different versions of the room, which fail for different reasons.
Hence, Searle does not achieve his stated goal of showing ``that a system could
have input and output capabilities that duplicated those of a native Chinese
speaker and s... | computer science |
35,324 | A Comparative Study of Arithmetic Constraints on Integer Intervals | cs.PL | We propose here a number of approaches to implement constraint propagation
for arithmetic constraints on integer intervals. To this end we introduce
integer interval arithmetic. Each approach is explained using appropriate proof
rules that reduce the variable domains. We compare these approaches using a set
of benchmar... | computer science |
35,325 | Where Fail-Safe Default Logics Fail | cs.AI | Reiter's original definition of default logic allows for the application of a
default that contradicts a previously applied one. We call failure this
condition. The possibility of generating failures has been in the past
considered as a semantical problem, and variants have been proposed to solve
it. We show that it is... | computer science |
35,326 | XML framework for concept description and knowledge representation | cs.AI | An XML framework for concept description is given, based upon the fact that
the tree structure of XML implies the logical structure of concepts as defined
by attributional calculus. Especially, the attribute-value representation is
implementable in the XML framework. Since the attribute-value representation is
an impor... | computer science |
35,327 | 2-Sat Sub-Clauses and the Hypernodal Structure of the 3-Sat Problem | cs.CC | Like simpler graphs, nested (hypernodal) graphs consist of two components: a
set of nodes and a set of edges, where each edge connects a pair of nodes. In
the hypernodal graph model, however, a node may contain other graphs, so that a
node may be contained in a graph that it contains. The inherently recursive
structure... | computer science |
35,328 | Splitting an operator: Algebraic modularity results for logics with
fixpoint semantics | cs.AI | It is well known that, under certain conditions, it is possible to split
logic programs under stable model semantics, i.e. to divide such a program into
a number of different "levels", such that the models of the entire program can
be constructed by incrementally constructing models for each level. Similar
results exis... | computer science |
35,329 | Quantum Computers | cs.AI | This research paper gives an overview of quantum computers - description of
their operation, differences between quantum and silicon computers, major
construction problems of a quantum computer and many other basic aspects. No
special scientific knowledge is necessary for the reader. | computer science |
35,330 | Deductive Algorithmic Knowledge | cs.AI | The framework of algorithmic knowledge assumes that agents use algorithms to
compute the facts they explicitly know. In many cases of interest, a deductive
system, rather than a particular algorithm, captures the formal reasoning used
by the agents to compute what they explicitly know. We introduce a logic for
reasonin... | computer science |
35,331 | A Logic for Reasoning about Evidence | cs.AI | We introduce a logic for reasoning about evidence that essentially views
evidence as a function from prior beliefs (before making an observation) to
posterior beliefs (after making the observation). We provide a sound and
complete axiomatization for the logic, and consider the complexity of the
decision problem. Althou... | computer science |
35,332 | A Framework for Combining Defeasible Argumentation with Labeled
Deduction | cs.AI | In the last years, there has been an increasing demand of a variety of
logical systems, prompted mostly by applications of logic in AI and other
related areas. Labeled Deductive Systems (LDS) were developed as a flexible
methodology to formalize such a kind of complex logical systems. Defeasible
argumentation has prove... | computer science |
35,333 | Directional Consistency for Continuous Numerical Constraints | cs.AI | Bounds consistency is usually enforced on continuous constraints by first
decomposing them into binary and ternary primitives. This decomposition has
long been shown to drastically slow down the computation of solutions. To
tackle this, Benhamou et al. have introduced an algorithm that avoids formally
decomposing const... | computer science |
35,334 | A Dynamic Clustering-Based Markov Model for Web Usage Mining | cs.IR | Markov models have been widely utilized for modelling user web navigation
behaviour. In this work we propose a dynamic clustering-based method to
increase a Markov model's accuracy in representing a collection of user web
navigation sessions. The method makes use of the state cloning concept to
duplicate states in a wa... | computer science |
35,335 | Web Services: A Process Algebra Approach | cs.AI | It is now well-admitted that formal methods are helpful for many issues
raised in the Web service area. In this paper we present a framework for the
design and verification of WSs using process algebras and their tools. We
define a two-way mapping between abstract specifications written using these
calculi and executab... | computer science |
35,336 | P=NP | cs.CC | We claim to resolve the P=?NP problem via a formal argument for P=NP. | computer science |
35,337 | Search Using N-gram Technique Based Statistical Analysis for Knowledge
Extraction in Case Based Reasoning Systems | cs.AI | Searching techniques for Case Based Reasoning systems involve extensive
methods of elimination. In this paper, we look at a new method of arriving at
the right solution by performing a series of transformations upon the data.
These involve N-gram based comparison and deduction of the input data with the
case data, usin... | computer science |
35,338 | Multi-agent coordination using nearest neighbor rules: revisiting the
Vicsek model | cs.MA | Recently, Jadbabaie, Lin, and Morse (IEEE TAC, 48(6)2003:988-1001) offered a
mathematical analysis of the discrete time model of groups of mobile autonomous
agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. showed
that all agents shall move in the same heading, provided that these agents are
peri... | computer science |
35,339 | On the Complexity of Case-Based Planning | cs.AI | We analyze the computational complexity of problems related to case-based
planning: planning when a plan for a similar instance is known, and planning
from a library of plans. We prove that planning from a single case has the same
complexity than generative planning (i.e., planning "from scratch"); using an
extended de... | computer science |
35,340 | Preferred Answer Sets for Ordered Logic Programs | cs.LO | We extend answer set semantics to deal with inconsistent programs (containing
classical negation), by finding a ``best'' answer set. Within the context of
inconsistent programs, it is natural to have a partial order on rules,
representing a preference for satisfying certain rules, possibly at the cost of
violating less... | computer science |
35,341 | A Sequent Calculus and a Theorem Prover for Standard Conditional Logics | cs.LO | In this paper we present a cut-free sequent calculus, called SeqS, for some
standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus
uses labels and transition formulas and can be used to prove decidability and
space complexity bounds for the respective logics. We also present CondLean, a
theorem... | computer science |
35,342 | On Global Warming (Softening Global Constraints) | cs.AI | We describe soft versions of the global cardinality constraint and the
regular constraint, with efficient filtering algorithms maintaining domain
consistency. For both constraints, the softening is achieved by augmenting the
underlying graph. The softened constraints can be used to extend the
meta-constraint framework ... | computer science |
35,343 | A CHR-based Implementation of Known Arc-Consistency | cs.LO | In classical CLP(FD) systems, domains of variables are completely known at
the beginning of the constraint propagation process. However, in systems
interacting with an external environment, acquiring the whole domains of
variables before the beginning of constraint propagation may cause waste of
computation time, or ev... | computer science |
35,344 | Default reasoning over domains and concept hierarchies | cs.AI | W.C. Rounds and G.-Q. Zhang (2001) have proposed to study a form of
disjunctive logic programming generalized to algebraic domains. This system
allows reasoning with information which is hierarchically structured and forms
a (suitable) domain. We extend this framework to include reasoning with default
negation, giving ... | computer science |
35,345 | Outlier Detection by Logic Programming | cs.AI | The development of effective knowledge discovery techniques has become in the
recent few years a very active research area due to the important impact it has
in several relevant application areas. One interesting task thereof is that of
singling out anomalous individuals from a given population, e.g., to detect
rare ev... | computer science |
35,346 | Augmenting ALC(D) (atemporal) roles and (aspatial) concrete domain with
temporal roles and a spatial concrete domain -first results | cs.AI | We consider the well-known family ALC(D) of description logics with a
concrete domain, and provide first results on a framework obtained by
augmenting ALC(D) atemporal roles and aspatial concrete domain with temporal
roles and a spatial concrete domain. | computer science |
35,347 | A TCSP-like decidable constraint language generalising existing cardinal
direction relations | cs.AI | We define a quantitative constraint language subsuming two calculi well-known
in QSR (Qualitative Spatial Reasoning): Frank's cone-shaped and
projection-based calculi of cardinal direction relations. We show how to solve
a CSP (Constraint Satisfaction Problem) expressed in the language. | computer science |
35,348 | An ALC(D)-based combination of temporal constraints and spatial
constraints suitable for continuous (spatial) change | cs.AI | We present a family of spatio-temporal theories suitable for continuous
spatial change in general, and for continuous motion of spatial scenes in
particular. The family is obtained by spatio-temporalising the well-known
ALC(D) family of Description Logics (DLs) with a concrete domain D, as follows,
where TCSPs denotes ... | computer science |
35,349 | Analyzing and Improving Performance of a Class of Anomaly-based
Intrusion Detectors | cs.CR | Anomaly-based intrusion detection (AID) techniques are useful for detecting
novel intrusions into computing resources. One of the most successful AID
detectors proposed to date is stide, which is based on analysis of system call
sequences. In this paper, we present a detailed formal framework to analyze,
understand and... | computer science |
35,350 | Intelligent search strategies based on adaptive Constraint Handling
Rules | cs.AI | The most advanced implementation of adaptive constraint processing with
Constraint Handling Rules (CHR) allows the application of intelligent search
strategies to solve Constraint Satisfaction Problems (CSP). This presentation
compares an improved version of conflict-directed backjumping and two variants
of dynamic bac... | computer science |
35,351 | Artificial Intelligence and Systems Theory: Applied to Cooperative
Robots | cs.RO | This paper describes an approach to the design of a population of cooperative
robots based on concepts borrowed from Systems Theory and Artificial
Intelligence. The research has been developed under the SocRob project, carried
out by the Intelligent Systems Laboratory at the Institute for Systems and
Robotics - Institu... | computer science |
35,352 | Topological Navigation of Simulated Robots using Occupancy Grid | cs.RO | Formerly I presented a metric navigation method in the Webots mobile robot
simulator. The navigating Khepera-like robot builds an occupancy grid of the
environment and explores the square-shaped room around with a value iteration
algorithm. Now I created a topological navigation procedure based on the
occupancy grid pr... | computer science |
35,353 | Bionic Humans Using EAP as Artificial Muscles Reality and Challenges | cs.RO | For many years, the idea of a human with bionic muscles immediately conjures
up science fiction images of a TV series superhuman character that was
implanted with bionic muscles and portrayed with strength and speed far
superior to any normal human. As fantastic as this idea may seem, recent
developments in electroacti... | computer science |
35,354 | A FP-Tree Based Approach for Mining All Strongly Correlated Pairs
without Candidate Generation | cs.DB | Given a user-specified minimum correlation threshold and a transaction
database, the problem of mining all-strong correlated pairs is to find all item
pairs with Pearson's correlation coefficients above the threshold . Despite the
use of upper bound based pruning technique in the Taper algorithm [1], when the
number of... | computer science |
35,355 | Ranking Pages by Topology and Popularity within Web Sites | cs.AI | We compare two link analysis ranking methods of web pages in a site. The
first, called Site Rank, is an adaptation of PageRank to the granularity of a
web site and the second, called Popularity Rank, is based on the frequencies of
user clicks on the outlinks in a page that are captured by navigation sessions
of users t... | computer science |
35,356 | Modeling Complex Higher Order Patterns | cs.DB | The goal of this paper is to show that generalizing the notion of frequent
patterns can be useful in extending association analysis to more complex higher
order patterns. To that end, we describe a general framework for modeling a
complex pattern based on evaluating the interestingness of its sub-patterns. A
key goal o... | computer science |
35,357 | A Link Clustering Based Approach for Clustering Categorical Data | cs.DL | Categorical data clustering (CDC) and link clustering (LC) have been
considered as separate research and application areas. The main focus of this
paper is to investigate the commonalities between these two problems and the
uses of these commonalities for the creation of new clustering algorithms for
categorical data b... | computer science |
35,358 | Finite Domain Bounds Consistency Revisited | cs.AI | A widely adopted approach to solving constraint satisfaction problems
combines systematic tree search with constraint propagation for pruning the
search space. Constraint propagation is performed by propagators implementing a
certain notion of consistency. Bounds consistency is the method of choice for
building propaga... | computer science |
35,359 | Removing Propagation Redundant Constraints in Redundant Modeling | cs.LO | A widely adopted approach to solving constraint satisfaction problems
combines systematic tree search with various degrees of constraint propagation
for pruning the search space. One common technique to improve the execution
efficiency is to add redundant constraints, which are constraints logically
implied by others i... | computer science |
35,360 | Neural Networks in Mobile Robot Motion | cs.RO | This paper deals with a path planning and intelligent control of an
autonomous robot which should move safely in partially structured environment.
This environment may involve any number of obstacles of arbitrary shape and
size; some of them are allowed to move. We describe our approach to solving the
motion-planning p... | computer science |
35,361 | Clustering Categorical Data Streams | cs.DB | The data stream model has been defined for new classes of applications
involving massive data being generated at a fast pace. Web click stream
analysis and detection of network intrusions are two examples. Cluster analysis
on data streams becomes more difficult, because the data objects in a data
stream must be accesse... | computer science |
35,362 | ANTIDS: Self-Organized Ant-based Clustering Model for Intrusion
Detection System | cs.CR | Security of computers and the networks that connect them is increasingly
becoming of great significance. Computer security is defined as the protection
of computing systems against threats to confidentiality, integrity, and
availability. There are two types of intruders: the external intruders who are
unauthorized user... | computer science |
35,363 | Self-Organizing the Abstract: Canvas as a Swarm Habitat for Collective
Memory, Perception and Cooperative Distributed Creativity | cs.MM | Past experiences under the designation of "Swarm Paintings" conducted in
2001, not only confirmed the possibility of realizing an artificial art (thus
non-human), as introduced into the process the questioning of creative
migration, specifically from the computer monitors to the canvas via a robotic
harm. In more recen... | computer science |
35,364 | Self-Organized Stigmergic Document Maps: Environment as a Mechanism for
Context Learning | cs.AI | Social insect societies and more specifically ant colonies, are distributed
systems that, in spite of the simplicity of their individuals, present a highly
structured social organization. As a result of this organization, ant colonies
can accomplish complex tasks that in some cases exceed the individual
capabilities of... | computer science |
35,365 | On the Implicit and on the Artificial - Morphogenesis and Emergent
Aesthetics in Autonomous Collective Systems | cs.AI | Imagine a "machine" where there is no pre-commitment to any particular
representational scheme: the desired behaviour is distributed and roughly
specified simultaneously among many parts, but there is minimal specification
of the mechanism required to generate that behaviour, i.e. the global behaviour
evolves from the ... | computer science |
35,366 | The MC2 Project [Machines of Collective Conscience]: A possible walk, up
to Life-like Complexity and Behaviour, from bottom, basic and simple
bio-inspired heuristics - a walk, up into the morphogenesis of information | cs.AI | Synergy (from the Greek word synergos), broadly defined, refers to combined
or co-operative effects produced by two or more elements (parts or
individuals). The definition is often associated with the holistic conviction
quote that "the whole is greater than the sum of its parts" (Aristotle, in
Metaphysics), or the who... | computer science |
35,367 | On the existence of stable models of non-stratified logic programs | cs.AI | This paper introduces a fundamental result, which is relevant for Answer Set
programming, and planning. For the first time since the definition of the
stable model semantics, the class of logic programs for which a stable model
exists is given a syntactic characterization. This condition may have a
practical importance... | computer science |
35,368 | A Logic for Non-Monotone Inductive Definitions | cs.AI | Well-known principles of induction include monotone induction and different
sorts of non-monotone induction such as inflationary induction, induction over
well-founded sets and iterated induction. In this work, we define a logic
formalizing induction over well-founded sets and monotone and iterated
induction. Just as t... | computer science |
35,369 | Data Mining for Actionable Knowledge: A Survey | cs.DB | The data mining process consists of a series of steps ranging from data
cleaning, data selection and transformation, to pattern evaluation and
visualization. One of the central problems in data mining is to make the mined
patterns or knowledge actionable. Here, the term actionable refers to the mined
patterns suggest c... | computer science |
35,370 | Semantical Characterizations and Complexity of Equivalences in Answer
Set Programming | cs.AI | In recent research on non-monotonic logic programming, repeatedly strong
equivalence of logic programs P and Q has been considered, which holds if the
programs P union R and Q union R have the same answer sets for any other
program R. This property strengthens equivalence of P and Q with respect to
answer sets (which i... | computer science |
35,371 | Graphs and colorings for answer set programming | cs.AI | We investigate the usage of rule dependency graphs and their colorings for
characterizing and computing answer sets of logic programs. This approach
provides us with insights into the interplay between rules when inducing answer
sets. We start with different characterizations of answer sets in terms of
totally colored ... | computer science |
35,372 | Towards a Systematic Account of Different Semantics for Logic Programs | cs.AI | In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which
allows to derive uniform characterizations of different declarative semantics
for logic programs with negation. One result from this work is that the
well-founded semantics can formally be understood as a stratified version of
the Fitting (or ... | computer science |
35,373 | Probabilistic Algorithmic Knowledge | cs.AI | The framework of algorithmic knowledge assumes that agents use deterministic
knowledge algorithms to compute the facts they explicitly know. We extend the
framework to allow for randomized knowledge algorithms. We then characterize
the information provided by a randomized knowledge algorithm when its answers
have some ... | computer science |
35,374 | Mining Top-k Approximate Frequent Patterns | cs.DB | Frequent pattern (itemset) mining in transactional databases is one of the
most well-studied problems in data mining. One obstacle that limits the
practical usage of frequent pattern mining is the extremely large number of
patterns generated. Such a large size of the output collection makes it
difficult for users to un... | computer science |
35,375 | Les représentations génétiques d'objets : simples analogies
ou modèles pertinents ? Le point de vue de l'
"évolutique".<br>–––<br>Genetic representations of
objects : simple analogies or efficient models ? The "evolutic" point of view | cs.AI | Depuis une trentaine d'ann\'{e}es, les ing\'{e}nieurs utilisent couramment
des analogies avec l'\'{e}volution naturelle pour optimiser des dispositifs
techniques. Le plus souvent, ces m\'{e}thodes "g\'{e}n\'{e}tiques" ou
"\'{e}volutionnaires" sont consid\'{e}r\'{e}es uniquement du point de vue
pratique, comme des m\'{e... | computer science |
35,376 | An Optimization Model for Outlier Detection in Categorical Data | cs.DB | The task of outlier detection is to find small groups of data objects that
are exceptional when compared with rest large amount of data. Detection of such
outliers is important for many applications such as fraud detection and
customer migration. Most existing methods are designed for numeric data. They
will encounter ... | computer science |
35,377 | Monotonic and Nonmonotonic Preference Revision | cs.DB | We study here preference revision, considering both the monotonic case where
the original preferences are preserved and the nonmonotonic case where the new
preferences may override the original ones. We use a relational framework in
which preferences are represented using binary relations (not necessarily
finite). We i... | computer science |
35,378 | Constraint-Based Qualitative Simulation | cs.AI | We consider qualitative simulation involving a finite set of qualitative
relations in presence of complete knowledge about their interrelationship. We
show how it can be naturally captured by means of constraints expressed in
temporal logic and constraint satisfaction problems. The constraints relate at
each stage the ... | computer science |
35,379 | Knowledge Representation Issues in Semantic Graphs for Relationship
Detection | cs.AI | An important task for Homeland Security is the prediction of threat
vulnerabilities, such as through the detection of relationships between
seemingly disjoint entities. A structure used for this task is a "semantic
graph", also known as a "relational data graph" or an "attributed relational
graph". These graphs encode ... | computer science |
35,380 | Cooperative Game Theory within Multi-Agent Systems for Systems
Scheduling | cs.AI | Research concerning organization and coordination within multi-agent systems
continues to draw from a variety of architectures and methodologies. The work
presented in this paper combines techniques from game theory and multi-agent
systems to produce self-organizing, polymorphic, lightweight, embedded agents
for system... | computer science |
35,381 | Beyond Hypertree Width: Decomposition Methods Without Decompositions | cs.CC | The general intractability of the constraint satisfaction problem has
motivated the study of restrictions on this problem that permit polynomial-time
solvability. One major line of work has focused on structural restrictions,
which arise from restricting the interaction among constraint scopes. In this
paper, we engage... | computer science |
35,382 | Relational reasoning in the region connection calculus | cs.AI | This paper is mainly concerned with the relation-algebraical aspects of the
well-known Region Connection Calculus (RCC). We show that the contact relation
algebra (CRA) of certain RCC model is not atomic complete and hence infinite.
So in general an extensional composition table for the RCC cannot be obtained
by simply... | computer science |
35,383 | A Unified Subspace Outlier Ensemble Framework for Outlier Detection in
High Dimensional Spaces | cs.DB | The task of outlier detection is to find small groups of data objects that
are exceptional when compared with rest large amount of data. Detection of such
outliers is important for many applications such as fraud detection and
customer migration. Most such applications are high dimensional domains in
which the data may... | computer science |
35,384 | Dominance Based Crossover Operator for Evolutionary Multi-objective
Algorithms | cs.AI | In spite of the recent quick growth of the Evolutionary Multi-objective
Optimization (EMO) research field, there has been few trials to adapt the
general variation operators to the particular context of the quest for the
Pareto-optimal set. The only exceptions are some mating restrictions that take
in account the dista... | computer science |
35,385 | Sparse Covariance Selection via Robust Maximum Likelihood Estimation | cs.CE | We address a problem of covariance selection, where we seek a trade-off
between a high likelihood against the number of non-zero elements in the
inverse covariance matrix. We solve a maximum likelihood problem with a penalty
term given by the sum of absolute values of the elements of the inverse
covariance matrix, and ... | computer science |
35,386 | Preferential and Preferential-discriminative Consequence relations | cs.AI | The present paper investigates consequence relations that are both
non-monotonic and paraconsistent. More precisely, we put the focus on
preferential consequence relations, i.e. those relations that can be defined by
a binary preference relation on states labelled by valuations. We worked with a
general notion of valua... | computer science |
35,387 | Redundancy in Logic II: 2CNF and Horn Propositional Formulae | cs.AI | We report complexity results about redundancy of formulae in 2CNF form. We
first consider the problem of checking redundancy and show some algorithms that
are slightly better than the trivial one. We then analyze problems related to
finding irredundant equivalent subsets (I.E.S.) of a given set. The concept of
cyclicit... | computer science |
35,388 | Enhancing Global SLS-Resolution with Loop Cutting and Tabling Mechanisms | cs.LO | Global SLS-resolution is a well-known procedural semantics for top-down
computation of queries under the well-founded model. It inherits from
SLDNF-resolution the {\em linearity} property of derivations, which makes it
easy and efficient to implement using a simple stack-based memory structure.
However, like SLDNF-reso... | computer science |
35,389 | Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku | cs.DS | We provide a simple linear time transformation from a directed or undirected
graph with labeled edges to an unlabeled digraph, such that paths in the input
graph in which no two consecutive edges have the same label correspond to paths
in the transformed graph and vice versa. Using this transformation, we provide
effic... | computer science |
35,390 | A Fast Greedy Algorithm for Outlier Mining | cs.DB | The task of outlier detection is to find small groups of data objects that
are exceptional when compared with rest large amount of data. In [38], the
problem of outlier detection in categorical data is defined as an optimization
problem and a local-search heuristic based algorithm (LSA) is presented.
However, as is the... | computer science |
35,391 | Conjunctive Query Containment and Answering under Description Logics
Constraints | cs.DB | Query containment and query answering are two important computational tasks
in databases. While query answering amounts to compute the result of a query
over a database, query containment is the problem of checking whether for every
database, the result of one query is a subset of the result of another query.
In this... | computer science |
35,392 | Polymorphic Self-* Agents for Stigmergic Fault Mitigation in Large-Scale
Real-Time Embedded Systems | cs.AI | Organization and coordination of agents within large-scale, complex,
distributed environments is one of the primary challenges in the field of
multi-agent systems. A lot of interest has surfaced recently around self-*
(self-organizing, self-managing, self-optimizing, self-protecting) agents. This
paper presents polymor... | computer science |
35,393 | A primer on Answer Set Programming | cs.AI | A introduction to the syntax and Semantics of Answer Set Programming intended
as an handout to [under]graduate students taking Artificial Intlligence or
Logic Programming classes. | computer science |
35,394 | Transitive Text Mining for Information Extraction and Hypothesis
Generation | cs.IR | Transitive text mining - also named Swanson Linking (SL) after its primary
and principal researcher - tries to establish meaningful links between
literature sets which are virtually disjoint in the sense that each does not
mention the main concept of the other. If successful, SL may give rise to the
development of new ... | computer science |
35,395 | Authoring case based training by document data extraction | cs.AI | In this paper, we propose an scalable approach to modeling based upon word
processing documents, and we describe the tool Phoenix providing the technical
infrastructure.
For our training environment d3web.Train, we developed a tool to extract case
knowledge from existing documents, usually dismissal records, extendin... | computer science |
35,396 | Interactive Unawareness Revisited | cs.AI | We analyze a model of interactive unawareness introduced by Heifetz, Meier
and Schipper (HMS). We consider two axiomatizations for their model, which
capture different notions of validity. These axiomatizations allow us to
compare the HMS approach to both the standard (S5) epistemic logic and two
other approaches to un... | computer science |
35,397 | CP-nets and Nash equilibria | cs.GT | We relate here two formalisms that are used for different purposes in
reasoning about multi-agent systems. One of them are strategic games that are
used to capture the idea that agents interact with each other while pursuing
their own interest. The other are CP-nets that were introduced to express
qualitative and condi... | computer science |
35,398 | Sur le statut référentiel des entités nommées | cs.AI | We show in this paper that, on the one hand, named entities can be designated
using different denominations and that, on the second hand, names denoting
named entities are polysemous. The analysis cannot be limited to reference
resolution but should take into account naming strategies, which are mainly
based on two lin... | computer science |
35,399 | Hiérarchisation des règles d'association en fouille de textes | cs.IR | Extraction of association rules is widely used as a data mining method.
However, one of the limit of this approach comes from the large number of
extracted rules and the difficulty for a human expert to deal with the totality
of these rules. We propose to solve this problem by structuring the set of
rules into hierarch... | computer science |
35,400 | Applying Evolutionary Optimisation to Robot Obstacle Avoidance | cs.AI | This paper presents an artificial evolutionbased method for stereo image
analysis and its application to real-time obstacle detection and avoidance for
a mobile robot. It uses the Parisian approach, which consists here in splitting
the representation of the robot's environment into a large number of simple
primitives, ... | computer science |
35,401 | K-ANMI: A Mutual Information Based Clustering Algorithm for Categorical
Data | cs.AI | Clustering categorical data is an integral part of data mining and has
attracted much attention recently. In this paper, we present k-ANMI, a new
efficient algorithm for clustering categorical data. The k-ANMI algorithm works
in a way that is similar to the popular k-means algorithm, and the goodness of
clustering in e... | computer science |
35,402 | Towards a unified theory of logic programming semantics: Level mapping
characterizations of selector generated models | cs.AI | Currently, the variety of expressive extensions and different semantics
created for logic programs with negation is diverse and heterogeneous, and
there is a lack of comprehensive comparative studies which map out the
multitude of perspectives in a uniform way. Most recently, however, new
methodologies have been propos... | computer science |
35,403 | Integration of Declarative and Constraint Programming | cs.PL | Combining a set of existing constraint solvers into an integrated system of
cooperating solvers is a useful and economic principle to solve hybrid
constraint problems. In this paper we show that this approach can also be used
to integrate different language paradigms into a unified framework.
Furthermore, we study the ... | computer science |
35,404 | Artificial Agents and Speculative Bubbles | cs.GT | Pertaining to Agent-based Computational Economics (ACE), this work presents
two models for the rise and downfall of speculative bubbles through an exchange
price fixing based on double auction mechanisms. The first model is based on a
finite time horizon context, where the expected dividends decrease along time.
The se... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.