Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
19,402 | Big data and the SP theory of intelligence | cs.AI | This article is about how the "SP theory of intelligence" and its realisation
in the "SP machine" may, with advantage, be applied to the management and
analysis of big data. The SP system -- introduced in the article and fully
described elsewhere -- may help to overcome the problem of variety in big data:
it has potent... | computer science |
19,403 | Event-Object Reasoning with Curated Knowledge Bases: Deriving Missing
Information | cs.AI | The broader goal of our research is to formulate answers to why and how
questions with respect to knowledge bases, such as AURA. One issue we face when
reasoning with many available knowledge bases is that at times needed
information is missing. Examples of this include partially missing information
about next sub-even... | computer science |
19,404 | Structure Based Extended Resolution for Constraint Programming | cs.AI | Nogood learning is a powerful approach to reducing search in Constraint
Programming (CP) solvers. The current state of the art, called Lazy Clause
Generation (LCG), uses resolution to derive nogoods expressing the reasons for
each search failure. Such nogoods can prune other parts of the search tree,
producing exponent... | computer science |
19,405 | Implementing a Wall-In Building Placement in StarCraft with Declarative
Programming | cs.AI | In real-time strategy games like StarCraft, skilled players often block the
entrance to their base with buildings to prevent the opponent's units from
getting inside. This technique, called "walling-in", is a vital part of
player's skill set, allowing him to survive early aggression. However, current
artificial players... | computer science |
19,406 | A Decomposition of the Max-min Fair Curriculum-based Course Timetabling
Problem | cs.AI | We propose a decomposition of the max-min fair curriculum-based course
timetabling (MMF-CB-CTT) problem. The decomposition models the room assignment
subproblem as a generalized lexicographic bottleneck optimization problem
(LBOP). We show that the generalized LBOP can be solved efficiently if the
corresponding sum opt... | computer science |
19,407 | Proteus: A Hierarchical Portfolio of Solvers and Transformations | cs.AI | In recent years, portfolio approaches to solving SAT problems and CSPs have
become increasingly common. There are also a number of different encodings for
representing CSPs as SAT instances. In this paper, we leverage advances in both
SAT and CSP solving to present a novel hierarchical portfolio-based approach to
CSP s... | computer science |
19,408 | Computation of Diet Composition for Patients Suffering from Kidney and
Urinary Tract Diseases with the Fuzzy Genetic System | cs.AI | Determination of dietary food consumed a day for patients with diseases in
general, greatly affect the health of the body and the healing process, is no
exception for people with kidney disease and urinary tract. This paper presents
the determination of diet composition in the form of food subtance for people
with kidn... | computer science |
19,409 | Metaheuristics in Flood Disaster Management and Risk Assessment | cs.AI | A conceptual area is divided into units or barangays, each was allowed to
evolve under a physical constraint. A risk assessment method was then used to
identify the flood risk in each community using the following risk factors: the
area's urbanized area ratio, literacy rate, mortality rate, poverty incidence,
radio/TV ... | computer science |
19,410 | A Fuzzy Topsis Multiple-Attribute Decision Making for Scholarship
Selection | cs.AI | As the education fees are becoming more expensive, more students apply for
scholarships. Consequently, hundreds and even thousands of applications need to
be handled by the sponsor. To solve the problems, some alternatives based on
several attributes (criteria) need to be selected. In order to make a decision
on such f... | computer science |
19,411 | Axiomatic properties of inconsistency indices for pairwise comparisons | cs.AI | Pairwise comparisons are a well-known method for the representation of the
subjective preferences of a decision maker. Evaluating their inconsistency has
been a widely studied and discussed topic and several indices have been
proposed in the literature to perform this task. Since an acceptable level of
consistency is c... | computer science |
19,412 | Lagrangian Relaxation for MAP Estimation in Graphical Models | cs.AI | We develop a general framework for MAP estimation in discrete and Gaussian
graphical models using Lagrangian relaxation techniques. The key idea is to
reformulate an intractable estimation problem as one defined on a more
tractable graph, but subject to additional constraints. Relaxing these
constraints gives a tractab... | computer science |
19,413 | Analyzing covert social network foundation behind terrorism disaster | cs.AI | This paper addresses a method to analyze the covert social network foundation
hidden behind the terrorism disaster. It is to solve a node discovery problem,
which means to discover a node, which functions relevantly in a social network,
but escaped from monitoring on the presence and mutual relationship of nodes.
The m... | computer science |
19,414 | Node discovery problem for a social network | cs.AI | Methods to solve a node discovery problem for a social network are presented.
Covert nodes refer to the nodes which are not observable directly. They
transmit the influence and affect the resulting collaborative activities among
the persons in a social network, but do not appear in the surveillance logs
which record th... | computer science |
19,415 | Determining the Unithood of Word Sequences using a Probabilistic
Approach | cs.AI | Most research related to unithood were conducted as part of a larger effort
for the determination of termhood. Consequently, novelties are rare in this
small sub-field of term extraction. In addition, existing work were mostly
empirically motivated and derived. We propose a new probabilistically-derived
measure, indepe... | computer science |
19,416 | Determining the Unithood of Word Sequences using Mutual Information and
Independence Measure | cs.AI | Most works related to unithood were conducted as part of a larger effort for
the determination of termhood. Consequently, the number of independent research
that study the notion of unithood and produce dedicated techniques for
measuring unithood is extremely small. We propose a new approach, independent
of any influen... | computer science |
19,417 | Enhanced Integrated Scoring for Cleaning Dirty Texts | cs.AI | An increasing number of approaches for ontology engineering from text are
gearing towards the use of online sources such as company intranet and the
World Wide Web. Despite such rise, not much work can be found in aspects of
preprocessing and cleaning dirty texts from online sources. This paper presents
an enhancement ... | computer science |
19,418 | On-the-fly Macros | cs.AI | We present a domain-independent algorithm that computes macros in a novel
way. Our algorithm computes macros "on-the-fly" for a given set of states and
does not require previously learned or inferred information, nor prior domain
knowledge. The algorithm is used to define new domain-independent tractable
classes of cla... | computer science |
19,419 | Modeling of Social Transitions Using Intelligent Systems | cs.AI | In this study, we reproduce two new hybrid intelligent systems, involve three
prominent intelligent computing and approximate reasoning methods: Self
Organizing feature Map (SOM), Neruo-Fuzzy Inference System and Rough Set Theory
(RST),called SONFIS and SORST. We show how our algorithms can be construed as a
linkage of... | computer science |
19,420 | Relationship between Diversity and Perfomance of Multiple Classifiers
for Decision Support | cs.AI | The paper presents the investigation and implementation of the relationship
between diversity and the performance of multiple classifiers on classification
accuracy. The study is critical as to build classifiers that are strong and can
generalize better. The parameters of the neural network within the committee
were va... | computer science |
19,421 | Reasoning with Topological and Directional Spatial Information | cs.AI | Current research on qualitative spatial representation and reasoning mainly
focuses on one single aspect of space. In real world applications, however,
multiple spatial aspects are often involved simultaneously.
This paper investigates problems arising in reasoning with combined
topological and directional informatio... | computer science |
19,422 | Reasoning about Cardinal Directions between Extended Objects | cs.AI | Direction relations between extended spatial objects are important
commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model,
known as Cardinal Direction Calculus (CDC), for representing direction
relations between connected plane regions. CDC is perhaps the most expressive
qualitative calculus for d... | computer science |
19,423 | On Planning with Preferences in HTN | cs.AI | In this paper, we address the problem of generating preferred plans by
combining the procedural control knowledge specified by Hierarchical Task
Networks (HTNs) with rich qualitative user preferences. The outcome of our work
is a language for specifyin user preferences, tailored to HTN planning,
together with a provabl... | computer science |
19,424 | Assessing the Impact of Informedness on a Consultant's Profit | cs.AI | We study the notion of informedness in a client-consultant setting. Using a
software simulator, we examine the extent to which it pays off for consultants
to provide their clients with advice that is well-informed, or with advice that
is merely meant to appear to be well-informed. The latter strategy is
beneficial in t... | computer science |
19,425 | A multiagent urban traffic simulation Part I: dealing with the ordinary | cs.AI | We describe in this article a multiagent urban traffic simulation, as we
believe individual-based modeling is necessary to encompass the complex
influence the actions of an individual vehicle can have on the overall flow of
vehicles. We first describe how we build a graph description of the network
from purely geometri... | computer science |
19,426 | n-Opposition theory to structure debates | cs.AI | 2007 was the first international congress on the ?square of oppositions?. A
first attempt to structure debate using n-opposition theory was presented along
with the results of a first experiment on the web. Our proposal for this paper
is to define relations between arguments through a structure of opposition
(square of... | computer science |
19,427 | Paired Comparisons-based Interactive Differential Evolution | cs.AI | We propose Interactive Differential Evolution (IDE) based on paired
comparisons for reducing user fatigue and evaluate its convergence speed in
comparison with Interactive Genetic Algorithms (IGA) and tournament IGA. User
interface and convergence performance are two big keys for reducing Interactive
Evolutionary Compu... | computer science |
19,428 | Back analysis based on SOM-RST system | cs.AI | This paper describes application of information granulation theory, on the
back analysis of Jeffrey mine southeast wall Quebec. In this manner, using a
combining of Self Organizing Map (SOM) and rough set theory (RST), crisp and
rough granules are obtained. Balancing of crisp granules and sub rough granules
is rendered... | computer science |
19,429 | Similarity Matching Techniques for Fault Diagnosis in Automotive
Infotainment Electronics | cs.AI | Fault diagnosis has become a very important area of research during the last
decade due to the advancement of mechanical and electrical systems in
industries. The automobile is a crucial field where fault diagnosis is given a
special attention. Due to the increasing complexity and newly added features in
vehicles, a co... | computer science |
19,430 | Performing Hybrid Recommendation in Intermodal Transportation-the
FTMarket System's Recommendation Module | cs.AI | Diverse recommendation techniques have been already proposed and encapsulated
into several e-business applications, aiming to perform a more accurate
evaluation of the existing information and accordingly augment the assistance
provided to the users involved. This paper reports on the development and
integration of a r... | computer science |
19,431 | Decomposition of the NVALUE constraint | cs.AI | We study decompositions of NVALUE, a global constraint that can be used to
model a wide range of problems where values need to be counted. Whilst
decomposition typically hinders propagation, we identify one decomposition that
maintains a global view as enforcing bound consistency on the decomposition
achieves bound con... | computer science |
19,432 | Symmetries of Symmetry Breaking Constraints | cs.AI | Symmetry is an important feature of many constraint programs. We show that
any symmetry acting on a set of symmetry breaking constraints can be used to
break symmetry. Different symmetries pick out different solutions in each
symmetry class. We use these observations in two methods for eliminating
symmetry from a probl... | computer science |
19,433 | Elicitation strategies for fuzzy constraint problems with missing
preferences: algorithms and experimental studies | cs.AI | Fuzzy constraints are a popular approach to handle preferences and
over-constrained problems in scenarios where one needs to be cautious, such as
in medical or space applications. We consider here fuzzy constraint problems
where some of the preferences may be missing. This models, for example,
settings where agents are... | computer science |
19,434 | Flow-Based Propagators for the SEQUENCE and Related Global Constraints | cs.AI | We propose new filtering algorithms for the SEQUENCE constraint and some
extensions of the SEQUENCE constraint based on network flows. We enforce domain
consistency on the SEQUENCE constraint in $O(n^2)$ time down a branch of the
search tree. This improves upon the best existing domain consistency algorithm
by a factor... | computer science |
19,435 | The Weighted CFG Constraint | cs.AI | We introduce the weighted CFG constraint and propose a propagation algorithm
that enforces domain consistency in $O(n^3|G|)$ time. We show that this
algorithm can be decomposed into a set of primitive arithmetic constraints
without hindering propagation. | computer science |
19,436 | A New Technique for Combining Multiple Classifiers using The
Dempster-Shafer Theory of Evidence | cs.AI | This paper presents a new classifier combination technique based on the
Dempster-Shafer theory of evidence. The Dempster-Shafer theory of evidence is a
powerful method for combining measures of evidence from different classifiers.
However, since each of the available methods that estimates the evidence of
classifiers h... | computer science |
19,437 | Searching for Bayesian Network Structures in the Space of Restricted
Acyclic Partially Directed Graphs | cs.AI | Although many algorithms have been designed to construct Bayesian network
structures using different approaches and principles, they all employ only two
methods: those based on independence criteria, and those based on a scoring
function and a search procedure (although some methods combine the two). Within
the score+s... | computer science |
19,438 | Learning to Order BDD Variables in Verification | cs.AI | The size and complexity of software and hardware systems have significantly
increased in the past years. As a result, it is harder to guarantee their
correct behavior. One of the most successful methods for automated verification
of finite-state systems is model checking. Most of the current model-checking
systems use ... | computer science |
19,439 | Decentralized Supply Chain Formation: A Market Protocol and Competitive
Equilibrium Analysis | cs.AI | Supply chain formation is the process of determining the structure and terms
of exchange relationships to enable a multilevel, multiagent production
activity. We present a simple model of supply chains, highlighting two
characteristic features: hierarchical subtask decomposition, and resource
contention. To decentraliz... | computer science |
19,440 | CP-nets: A Tool for Representing and Reasoning withConditional Ceteris
Paribus Preference Statements | cs.AI | Information about user preferences plays a key role in automated decision
making. In many domains it is desirable to assess such preferences in a
qualitative rather than quantitative way. In this paper, we propose a
qualitative graphical representation of preferences that reflects conditional
dependence and independenc... | computer science |
19,441 | Complexity Results and Approximation Strategies for MAP Explanations | cs.AI | MAP is the problem of finding a most probable instantiation of a set of
variables given evidence. MAP has always been perceived to be significantly
harder than the related problems of computing the probability of a variable
instantiation Pr, or the problem of computing the most probable explanation
(MPE). This paper in... | computer science |
19,442 | Taming Numbers and Durations in the Model Checking Integrated Planning
System | cs.AI | The Model Checking Integrated Planning System (MIPS) is a temporal least
commitment heuristic search planner based on a flexible object-oriented
workbench architecture. Its design clearly separates explicit and symbolic
directed exploration algorithms from the set of on-line and off-line computed
estimates and associat... | computer science |
19,443 | IDL-Expressions: A Formalism for Representing and Parsing Finite
Languages in Natural Language Processing | cs.AI | We propose a formalism for representation of finite languages, referred to as
the class of IDL-expressions, which combines concepts that were only considered
in isolation in existing formalisms. The suggested applications are in natural
language processing, more specifically in surface natural language generation
and i... | computer science |
19,444 | Effective Dimensions of Hierarchical Latent Class Models | cs.AI | Hierarchical latent class (HLC) models are tree-structured Bayesian networks
where leaf nodes are observed while internal nodes are latent. There are no
theoretically well justified model selection criteria for HLC models in
particular and Bayesian networks with latent nodes in general. Nonetheless,
empirical studies s... | computer science |
19,445 | Coherent Integration of Databases by Abductive Logic Programming | cs.AI | We introduce an abductive method for a coherent integration of independent
data-sources. The idea is to compute a list of data-facts that should be
inserted to the amalgamated database or retracted from it in order to restore
its consistency. This method is implemented by an abductive solver, called
Asystem, that appli... | computer science |
19,446 | Grounded Semantic Composition for Visual Scenes | cs.AI | We present a visually-grounded language understanding model based on a study
of how people verbally describe objects in scenes. The emphasis of the model is
on the combination of individual word meanings to produce meanings for complex
referring expressions. The model has been implemented, and it is able to
understand ... | computer science |
19,447 | Price Prediction in a Trading Agent Competition | cs.AI | The 2002 Trading Agent Competition (TAC) presented a challenging market game
in the domain of travel shopping. One of the pivotal issues in this domain is
uncertainty about hotel prices, which have a significant influence on the
relative cost of alternative trip schedules. Thus, virtually all participants
employ some m... | computer science |
19,448 | Compositional Model Repositories via Dynamic Constraint Satisfaction
with Order-of-Magnitude Preferences | cs.AI | The predominant knowledge-based approach to automated model construction,
compositional modelling, employs a set of models of particular functional
components. Its inference mechanism takes a scenario describing the constituent
interacting components of a system and translates it into a useful mathematical
model. This ... | computer science |
19,449 | Competitive Coevolution through Evolutionary Complexification | cs.AI | Two major goals in machine learning are the discovery and improvement of
solutions to complex problems. In this paper, we argue that complexification,
i.e. the incremental elaboration of solutions through adding new structure,
achieves both these goals. We demonstrate the power of complexification through
the NeuroEvol... | computer science |
19,450 | Dual Modelling of Permutation and Injection Problems | cs.AI | When writing a constraint program, we have to choose which variables should
be the decision variables, and how to represent the constraints on these
variables. In many cases, there is considerable choice for the decision
variables. Consider, for example, permutation problems in which we have as many
values as variables... | computer science |
19,451 | Generalizing Boolean Satisfiability I: Background and Survey of Existing
Work | cs.AI | This is the first of three planned papers describing ZAP, a satisfiability
engine that substantially generalizes existing tools while retaining the
performance characteristics of modern high-performance solvers. The fundamental
idea underlying ZAP is that many problems passed to such engines contain rich
internal struc... | computer science |
19,452 | PHA*: Finding the Shortest Path with A* in An Unknown Physical
Environment | cs.AI | We address the problem of finding the shortest path between two points in an
unknown real physical environment, where a traveling agent must move around in
the environment to explore unknown territory. We introduce the Physical-A*
algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes
that A* w... | computer science |
19,453 | Restricted Value Iteration: Theory and Algorithms | cs.AI | Value iteration is a popular algorithm for finding near optimal policies for
POMDPs. It is inefficient due to the need to account for the entire belief
space, which necessitates the solution of large numbers of linear programs. In
this paper, we study value iteration restricted to belief subsets. We show
that, together... | computer science |
19,454 | A Maximal Tractable Class of Soft Constraints | cs.AI | Many researchers in artificial intelligence are beginning to explore the use
of soft constraints to express a set of (possibly conflicting) problem
requirements. A soft constraint is a function defined on a collection of
variables which associates some measure of desirability with each possible
combination of values fo... | computer science |
19,455 | Towards Understanding and Harnessing the Potential of Clause Learning | cs.AI | Efficient implementations of DPLL with the addition of clause learning are
the fastest complete Boolean satisfiability solvers and can handle many
significant real-world problems, such as verification, planning and design.
Despite its importance, little is known of the ultimate strengths and
limitations of the techniqu... | computer science |
19,456 | Graduality in Argumentation | cs.AI | Argumentation is based on the exchange and valuation of interacting
arguments, followed by the selection of the most acceptable of them (for
example, in order to take a decision, to make a choice). Starting from the
framework proposed by Dung in 1995, our purpose is to introduce 'graduality' in
the selection of the bes... | computer science |
19,457 | Explicit Learning Curves for Transduction and Application to Clustering
and Compression Algorithms | cs.AI | Inductive learning is based on inferring a general rule from a finite data
set and using it to label new data. In transduction one attempts to solve the
problem of using a labeled training set to label a set of unlabeled points,
which are given to the learner prior to learning. Although transduction seems
at the outset... | computer science |
19,458 | Decentralized Control of Cooperative Systems: Categorization and
Complexity Analysis | cs.AI | Decentralized control of cooperative systems captures the operation of a
group of decision makers that share a single global objective. The difficulty
in solving optimally such problems arises when the agents lack full
observability of the global state of the system when they operate. The general
problem has been shown... | computer science |
19,459 | Reinforcement Learning for Agents with Many Sensors and Actuators Acting
in Categorizable Environments | cs.AI | In this paper, we confront the problem of applying reinforcement learning to
agents that perceive the environment through many sensors and that can perform
parallel actions using many actuators as is the case in complex autonomous
robots. We argue that reinforcement learning can only be successfully applied
to this cas... | computer science |
19,460 | Additive Pattern Database Heuristics | cs.AI | We explore a method for computing admissible heuristic evaluation functions
for search problems. It utilizes pattern databases, which are precomputed
tables of the exact cost of solving various subproblems of an existing problem.
Unlike standard pattern database heuristics, however, we partition our problems
into disjo... | computer science |
19,461 | On Prediction Using Variable Order Markov Models | cs.AI | This paper is concerned with algorithms for prediction of discrete sequences
over a finite alphabet, using variable order Markov models. The class of such
algorithms is large and in principle includes any lossless compression
algorithm. We focus on six prominent prediction algorithms, including Context
Tree Weighting (... | computer science |
19,462 | Ordered Landmarks in Planning | cs.AI | Many known planning tasks have inherent constraints concerning the best order
in which to achieve the goals. A number of research efforts have been made to
detect such constraints and to use them for guiding search, in the hope of
speeding up the planning process. We go beyond the previous approaches by
considering ord... | computer science |
19,463 | Finding Approximate POMDP solutions Through Belief Compression | cs.AI | Standard value function approaches to finding policies for Partially
Observable Markov Decision Processes (POMDPs) are generally considered to be
intractable for large models. The intractability of these algorithms is to a
large extent a consequence of computing an exact, optimal policy over the
entire belief space. Ho... | computer science |
19,464 | A Comprehensive Trainable Error Model for Sung Music Queries | cs.AI | We propose a model for errors in sung queries, a variant of the hidden Markov
model (HMM). This is a solution to the problem of identifying the degree of
similarity between a (typically error-laden) sung query and a potential target
in a database of musical works, an important problem in the field of music
information ... | computer science |
19,465 | Phase Transitions and Backbones of the Asymmetric Traveling Salesman
Problem | cs.AI | In recent years, there has been much interest in phase transitions of
combinatorial problems. Phase transitions have been successfully used to
analyze combinatorial optimization problems, characterize their typical-case
features and locate the hardest problem instances. In this paper, we study
phase transitions of the ... | computer science |
19,466 | The Influence of Global Constraints on Similarity Measures for
Time-Series Databases | cs.AI | A time series consists of a series of values or events obtained over repeated
measurements in time. Analysis of time series represents and important tool in
many application areas, such as stock market analysis, process and quality
control, observation of natural phenomena, medical treatments, etc. A vital
component in... | computer science |
19,467 | Law of Connectivity in Machine Learning | cs.AI | We present in this paper our law that there is always a connection present
between two entities, with a selfconnection being present at least in each
node. An entity is an object, physical or imaginary, that is connected by a
path (or connection) and which is important for achieving the desired result of
the scenario. ... | computer science |
19,468 | Simple Algorithm Portfolio for SAT | cs.AI | The importance of algorithm portfolio techniques for SAT has long been noted,
and a number of very successful systems have been devised, including the most
successful one --- SATzilla. However, all these systems are quite complex (to
understand, reimplement, or modify). In this paper we propose a new algorithm
portfoli... | computer science |
19,469 | A Novel Multicriteria Group Decision Making Approach With Intuitionistic
Fuzzy SIR Method | cs.AI | The superiority and inferiority ranking (SIR) method is a generation of the
well-known PROMETHEE method, which can be more efficient to deal with
multi-criterion decision making (MCDM) problem. Intuitionistic fuzzy sets
(IFSs), as an important extension of fuzzy sets (IFs), include both membership
functions and non-mem... | computer science |
19,470 | Proceedings of the Doctoral Consortium and Poster Session of the 5th
International Symposium on Rules (RuleML 2011@IJCAI) | cs.AI | This volume contains the papers presented at the first edition of the
Doctoral Consortium of the 5th International Symposium on Rules (RuleML
2011@IJCAI) held on July 19th, 2011 in Barcelona, as well as the poster session
papers of the RuleML 2011@IJCAI main conference. | computer science |
19,471 | Knowledge Embedding and Retrieval Strategies in an Informledge System | cs.AI | Informledge System (ILS) is a knowledge network with autonomous nodes and
intelligent links that integrate and structure the pieces of knowledge. In this
paper, we put forward the strategies for knowledge embedding and retrieval in
an ILS. ILS is a powerful knowledge network system dealing with logical storage
and conn... | computer science |
19,472 | Extend Commitment Protocols with Temporal Regulations: Why and How | cs.AI | The proposal of Elisa Marengo's thesis is to extend commitment protocols to
explicitly account for temporal regulations. This extension will satisfy two
needs: (1) it will allow representing, in a flexible and modular way, temporal
regulations with a normative force, posed on the interaction, so as to
represent convent... | computer science |
19,473 | Rule-Based Semantic Sensing | cs.AI | Rule-Based Systems have been in use for decades to solve a variety of
problems but not in the sensor informatics domain. Rules aid the aggregation of
low-level sensor readings to form a more complete picture of the real world and
help to address 10 identified challenges for sensor network middleware. This
paper present... | computer science |
19,474 | Advancing Multi-Context Systems by Inconsistency Management | cs.AI | Multi-Context Systems are an expressive formalism to model (possibly)
non-monotonic information exchange between heterogeneous knowledge bases. Such
information exchange, however, often comes with unforseen side-effects leading
to violation of constraints, making the system inconsistent, and thus unusable.
Although the... | computer science |
19,475 | Rule-based query answering method for a knowledge base of economic
crimes | cs.AI | We present a description of the PhD thesis which aims to propose a rule-based
query answering method for relational data. In this approach we use an
additional knowledge which is represented as a set of rules and describes the
source data at concept (ontological) level. Queries are posed in the terms of
abstract level.... | computer science |
19,476 | Semantic-ontological combination of Business Rules and Business
Processes in IT Service Management | cs.AI | IT Service Management deals with managing a broad range of items related to
complex system environments. As there is both, a close connection to business
interests and IT infrastructure, the application of semantic expressions which
are seamlessly integrated within applications for managing ITSM environments,
can help ... | computer science |
19,477 | An Ontology-driven Framework for Supporting Complex Decision Process | cs.AI | The study proposes a framework of ONTOlogy-based Group Decision Support
System (ONTOGDSS) for decision process which exhibits the complex structure of
decision-problem and decision-group. It is capable of reducing the complexity
of problem structure and group relations. The system allows decision makers to
participate ... | computer science |
19,478 | A Temporal Neuro-Fuzzy Monitoring System to Manufacturing Systems | cs.AI | Fault diagnosis and failure prognosis are essential techniques in improving
the safety of many manufacturing systems. Therefore, on-line fault detection
and isolation is one of the most important tasks in safety-critical and
intelligent control systems. Computational intelligence techniques are being
investigated as ex... | computer science |
19,479 | Towards Open-Text Semantic Parsing via Multi-Task Learning of Structured
Embeddings | cs.AI | Open-text (or open-domain) semantic parsers are designed to interpret any
statement in natural language by inferring a corresponding meaning
representation (MR). Unfortunately, large scale systems cannot be easily
machine-learned due to lack of directly supervised data. We propose here a
method that learns to assign MR... | computer science |
19,480 | Online Anomaly Detection Systems Using Incremental Commute Time | cs.AI | Commute Time Distance (CTD) is a random walk based metric on graphs. CTD has
found widespread applications in many domains including personalized search,
collaborative filtering and making search engines robust against manipulation.
Our interest is inspired by the use of CTD as a metric for anomaly detection.
It has be... | computer science |
19,481 | Towards Completely Lifted Search-based Probabilistic Inference | cs.AI | The promise of lifted probabilistic inference is to carry out probabilistic
inference in a relational probabilistic model without needing to reason about
each individual separately (grounding out the representation) by treating the
undistinguished individuals as a block. Current exact methods still need to
ground out i... | computer science |
19,482 | Local Optima Networks of the Quadratic Assignment Problem | cs.AI | Using a recently proposed model for combinatorial landscapes, Local Optima
Networks (LON), we conduct a thorough analysis of two types of instances of the
Quadratic Assignment Problem (QAP). This network model is a reduction of the
landscape in which the nodes correspond to the local optima, and the edges
account for t... | computer science |
19,483 | Local Optima Networks of NK Landscapes with Neutrality | cs.AI | In previous work we have introduced a network-based model that abstracts many
details of the underlying landscape and compresses the landscape information
into a weighted, oriented graph which we call the local optima network. The
vertices of this graph are the local optima of the given fitness landscape,
while the arc... | computer science |
19,484 | Centric selection: a way to tune the exploration/exploitation trade-off | cs.AI | In this paper, we study the exploration / exploitation trade-off in cellular
genetic algorithms. We define a new selection scheme, the centric selection,
which is tunable and allows controlling the selective pressure with a single
parameter. The equilibrium model is used to study the influence of the centric
selection ... | computer science |
19,485 | NK landscapes difficulty and Negative Slope Coefficient: How Sampling
Influences the Results | cs.AI | Negative Slope Coefficient is an indicator of problem hardness that has been
introduced in 2004 and that has returned promising results on a large set of
problems. It is based on the concept of fitness cloud and works by partitioning
the cloud into a number of bins representing as many different regions of the
fitness ... | computer science |
19,486 | Interactive ontology debugging: two query strategies for efficient fault
localization | cs.AI | Effective debugging of ontologies is an important prerequisite for their
broad application, especially in areas that rely on everyday users to create
and maintain knowledge bases, such as the Semantic Web. In such systems
ontologies capture formalized vocabularies of terms shared by its users.
However in many cases use... | computer science |
19,487 | MeLinDa: an interlinking framework for the web of data | cs.AI | The web of data consists of data published on the web in such a way that they
can be interpreted and connected together. It is thus critical to establish
links between these data, both for the web of data and for the semantic web
that it contributes to feed. We consider here the various techniques developed
for that pu... | computer science |
19,488 | Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries | cs.AI | Symmetries occur naturally in CSP or SAT problems and are not very difficult
to discover, but using them to prune the search space tends to be very
challenging. Indeed, this usually requires finding specific elements in a group
of symmetries that can be huge, and the problem of their very existence is
NP-hard. We formu... | computer science |
19,489 | Actual Causation in CP-logic | cs.AI | Given a causal model of some domain and a particular story that has taken
place in this domain, the problem of actual causation is deciding which of the
possible causes for some effect actually caused it. One of the most influential
approaches to this problem has been developed by Halpern and Pearl in the
context of st... | computer science |
19,490 | Instantiation Schemes for Nested Theories | cs.AI | This paper investigates under which conditions instantiation-based proof
procedures can be combined in a nested way, in order to mechanically construct
new instantiation procedures for richer theories. Interesting applications in
the field of verification are emphasized, particularly for handling extensions
of the theo... | computer science |
19,491 | HyFlex: A Benchmark Framework for Cross-domain Heuristic Search | cs.AI | Automating the design of heuristic search methods is an active research field
within computer science, artificial intelligence and operational research. In
order to make these methods more generally applicable, it is important to
eliminate or reduce the role of the human expert in the process of designing an
effective ... | computer science |
19,492 | Selecting Attributes for Sport Forecasting using Formal Concept Analysis | cs.AI | In order to address complex systems, apply pattern recongnition on their
evolution could play an key role to understand their dynamics. Global patterns
are required to detect emergent concepts and trends, some of them with
qualitative nature. Formal Concept Analysis (FCA) is a theory whose goal is to
discover and to ex... | computer science |
19,493 | Information, Utility & Bounded Rationality | cs.AI | Perfectly rational decision-makers maximize expected utility, but crucially
ignore the resource costs incurred when determining optimal actions. Here we
employ an axiomatic framework for bounded rational decision-making based on a
thermodynamic interpretation of resource costs as information costs. This leads
to a vari... | computer science |
19,494 | Technical Note: Towards ROC Curves in Cost Space | cs.AI | ROC curves and cost curves are two popular ways of visualising classifier
performance, finding appropriate thresholds according to the operating
condition, and deriving useful aggregated measures such as the area under the
ROC curve (AUC) or the area under the optimal cost curve. In this note we
present some new findin... | computer science |
19,495 | Universal Empathy and Ethical Bias for Artificial General Intelligence | cs.AI | Rational agents are usually built to maximize rewards. However, AGI agents
can find undesirable ways of maximizing any prior reward function. Therefore
value learning is crucial for safe AGI. We assume that generalized states of
the world are valuable - not rewards themselves, and propose an extension of
AIXI, in which... | computer science |
19,496 | Stratified Labelings for Abstract Argumentation | cs.AI | We introduce stratified labelings as a novel semantical approach to abstract
argumentation frameworks. Compared to standard labelings, stratified labelings
provide a more fine-grained assessment of the controversiality of arguments
using ranks instead of the usual labels in, out, and undecided. We relate the
framework ... | computer science |
19,497 | MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers | cs.AI | MaLeS is an automatic tuning framework for automated theorem provers. It
provides solutions for both the strategy finding as well as the strategy
scheduling problem. This paper describes the tool and the methods used in it,
and evaluates its performance on three automated theorem provers: E, LEO-II and
Satallax. An eva... | computer science |
19,498 | Deconstructing analogy | cs.AI | Analogy has been shown to be important in many key cognitive abilities,
including learning, problem solving, creativity and language change. For
cognitive models of analogy, the fundamental computational question is how its
inherent complexity (its NP-hardness) is solved by the human cognitive system.
Indeed, different... | computer science |
19,499 | Space as an invention of biological organisms | cs.AI | The question of the nature of space around us has occupied thinkers since the
dawn of humanity, with scientists and philosophers today implicitly assuming
that space is something that exists objectively. Here we show that this does
not have to be the case: the notion of space could emerge when biological
organisms seek... | computer science |
19,500 | Applying the Negative Selection Algorithm for Merger and Acquisition
Target Identification | cs.AI | In this paper, we propose a new methodology based on the Negative Selection
Algorithm that belongs to the field of Computational Intelligence,
specifically, Artificial Immune Systems to identify takeover targets. Although
considerable research based on customary statistical techniques and some
contemporary Computationa... | computer science |
19,501 | Extended Distributed Learning Automata:A New Method for Solving
Stochastic Graph Optimization Problems | cs.AI | In this paper, a new structure of cooperative learning automata so-called
extended learning automata (eDLA) is introduced. Based on the proposed
structure, a new iterative randomized heuristic algorithm for finding optimal
sub-graph in a stochastic edge-weighted graph through sampling is proposed. It
has been shown tha... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.