Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
20,102 | Why Local Search Excels in Expression Simplification | cs.AI | Simplifying expressions is important to make numerical integration of large
expressions from High Energy Physics tractable. To this end, Horner's method
can be used. Finding suitable Horner schemes is assumed to be hard, due to the
lack of local heuristics. Recently, MCTS was reported to be able to find near
optimal sc... | computer science |
20,103 | A Bayesian model for recognizing handwritten mathematical expressions | cs.AI | Recognizing handwritten mathematics is a challenging classification problem,
requiring simultaneous identification of all the symbols comprising an input as
well as the complex two-dimensional relationships between symbols and
subexpressions. Because of the ambiguity present in handwritten input, it is
often unrealisti... | computer science |
20,104 | Belief revision by examples | cs.AI | A common assumption in belief revision is that the reliability of the
information sources is either given, derived from temporal information, or the
same for all. This article does not describe a new semantics for integration
but the problem of obtaining the reliability of the sources given the result of
a previous mer... | computer science |
20,105 | Local Optimal Sets and Bounded Archiving on Multi-objective
NK-Landscapes with Correlated Objectives | cs.AI | The properties of local optimal solutions in multi-objective combinatorial
optimization problems are crucial for the effectiveness of local search
algorithms, particularly when these algorithms are based on Pareto dominance.
Such local search algorithms typically return a set of mutually nondominated
Pareto local optim... | computer science |
20,106 | On the Impact of Multiobjective Scalarizing Functions | cs.AI | Recently, there has been a renewed interest in decomposition-based approaches
for evolutionary multiobjective optimization. However, the impact of the choice
of the underlying scalarizing function(s) is still far from being well
understood. In this paper, we investigate the behavior of different scalarizing
functions a... | computer science |
20,107 | On tensor rank of conditional probability tables in Bayesian networks | cs.AI | A difficult task in modeling with Bayesian networks is the elicitation of
numerical parameters of Bayesian networks. A large number of parameters is
needed to specify a conditional probability table (CPT) that has a larger
parent set. In this paper we show that, most CPTs from real applications of
Bayesian networks can... | computer science |
20,108 | Feature-based tuning of simulated annealing applied to the
curriculum-based course timetabling problem | cs.AI | We consider the university course timetabling problem, which is one of the
most studied problems in educational timetabling. In particular, we focus our
attention on the formulation known as the curriculum-based course timetabling
problem, which has been tackled by many researchers and for which there are
many availabl... | computer science |
20,109 | Autonomous robots 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" (both outlined in the article) may help to solve
computer-related problems in the design of autonomous robots, meaning robots
that do not depend on external intelligence or power supplies, are mobile, and
are designed to e... | computer science |
20,110 | Medical diagnosis as pattern recognition in a framework of information
compression by multiple alignment, unification and search | cs.AI | This paper describes a novel approach to medical diagnosis based on the SP
theory of computing and cognition. The main attractions of this approach are: a
format for representing diseases that is simple and intuitive; an ability to
cope with errors and uncertainties in diagnostic information; the simplicity of
storing ... | computer science |
20,111 | Interference Effects in Quantum Belief Networks | cs.AI | Probabilistic graphical models such as Bayesian Networks are one of the most
powerful structures known by the Computer Science community for deriving
probabilistic inferences. However, modern cognitive psychology has revealed
that human decisions could not follow the rules of classical probability
theory, because human... | computer science |
20,112 | Modeling Creativity: Case Studies in Python | cs.AI | Modeling Creativity (doctoral dissertation, 2013) explores how creativity can
be represented using computational approaches. Our aim is to construct computer
models that exhibit creativity in an artistic context, that is, that are
capable of generating or evaluating an artwork (visual or linguistic), an
interesting new... | computer science |
20,113 | The Universe of Minds | cs.AI | The paper attempts to describe the space of possible mind designs by first
equating all minds to software. Next it proves some interesting properties of
the mind design space such as infinitude of minds, size and representation
complexity of minds. A survey of mind design taxonomies is followed by a
proposal for a new ... | computer science |
20,114 | Ontology-based Representation and Reasoning on Process Models: A Logic
Programming Approach | cs.AI | We propose a framework grounded in Logic Programming for representing and
reasoning about business processes from both the procedural and ontological
point of views. In particular, our goal is threefold: (1) define a logical
language and a formal semantics for process models enriched with ontology-based
annotations; (2... | computer science |
20,115 | An improved multimodal PSO method based on electrostatic interaction
using n- nearest-neighbor local search | cs.AI | In this paper, an improved multimodal optimization (MMO) algorithm,called
LSEPSO,has been proposed. LSEPSO combined Electrostatic Particle Swarm
Optimization (EPSO) algorithm and a local search method and then made some
modification on them. It has been shown to improve global and local optima
finding ability of the al... | computer science |
20,116 | Committment-Based Data-Aware Multi-Agent-Contexts Systems | cs.AI | Communication and interaction among agents have been the subject of extensive
investigation since many years. Commitment-based communication, where
communicating agents are seen as a debtor agent who is committed to a creditor
agent to bring about something (possibly under some conditions) is now very
well-established.... | computer science |
20,117 | Realizing RCC8 networks using convex regions | cs.AI | RCC8 is a popular fragment of the region connection calculus, in which
qualitative spatial relations between regions, such as adjacency, overlap and
parthood, can be expressed. While RCC8 is essentially dimensionless, most
current applications are confined to reasoning about two-dimensional or
three-dimensional physica... | computer science |
20,118 | Analysis of corporate environmental reports using statistical techniques
and data mining | cs.AI | Measuring the effectiveness of corporate environmental reports, it being
highly qualitative and less regulated, is often considered as a daunting task.
The task becomes more complex if comparisons are to be performed. This study is
undertaken to overcome the physical verification problems by implementing data
mining te... | computer science |
20,119 | Interactive Error Correction in Implicative Theories | cs.AI | Errors in implicative theories coming from binary data are studied. First,
two classes of errors that may affect implicative theories are singled out. Two
approaches for finding errors of these classes are proposed, both of them based
on methods of Formal Concept Analysis. The first approach uses the cardinality
minima... | computer science |
20,120 | Investigation of A Collective Decision Making System of Different
Neighbourhood-Size Based on Hyper-Geometric Distribution | cs.AI | The study of collective decision making system has become the central part of
the Swarm- Intelligence Related research in recent years. The most challenging
task of modelling a collec- tive decision making system is to develop the
macroscopic stochastic equation from its microscopic model. In this report we
have invest... | computer science |
20,121 | Towards a Model Theory for Distributed Representations | cs.AI | Distributed representations (such as those based on embeddings) and discrete
representations (such as those based on logic) have complementary strengths. We
explore one possible approach to combining these two kinds of representations.
We present a model theory/semantics for first order logic based on vectors of
reals.... | computer science |
20,122 | The Lovelace 2.0 Test of Artificial Creativity and Intelligence | cs.AI | Observing that the creation of certain types of artistic artifacts
necessitate intelligence, we present the Lovelace 2.0 Test of creativity as an
alternative to the Turing Test as a means of determining whether an agent is
intelligent. The Lovelace 2.0 Test builds off prior tests of creativity and
additionally provides... | computer science |
20,123 | Justifying and Improving Meta-Agent Conflict-Based Search | cs.AI | The Meta-Agent Conflict-Based Search~(MA-CBS) is a recently proposed
algorithm for the multi-agent path finding problem. The algorithm is an
extension of Conflict-Based Search~(CBS), which automatically merges
conflicting agents into meta-agents if the number of conflicts exceeds a
certain threshold. However, the decis... | computer science |
20,124 | Partial Optimality by Pruning for MAP-Inference with General Graphical
Models | cs.AI | We consider the energy minimization problem for undirected graphical models,
also known as MAP-inference problem for Markov random fields which is NP-hard
in general. We propose a novel polynomial time algorithm to obtain a part of
its optimal non-relaxed integral solution. Our algorithm is initialized with
variables t... | computer science |
20,125 | Augmenting Ordered Binary Decision Diagrams with Conjunctive
Decomposition | cs.AI | This paper augments OBDD with conjunctive decomposition to propose a
generalization called OBDD[$\wedge$]. By imposing reducedness and the finest
$\wedge$-decomposition bounded by integer $i$
($\wedge_{\widehat{i}}$-decomposition) on OBDD[$\wedge$], we identify a family
of canonical languages called ROBDD[$\wedge_{\wid... | computer science |
20,126 | On the Complexity of Optimization Problems based on Compiled NNF
Representations | cs.AI | Optimization is a key task in a number of applications. When the set of
feasible solutions under consideration is of combinatorial nature and described
in an implicit way as a set of constraints, optimization is typically NP-hard.
Fortunately, in many problems, the set of feasible solutions does not often
change and is... | computer science |
20,127 | Parameterizing the semantics of fuzzy attribute implications by systems
of isotone Galois connections | cs.AI | We study the semantics of fuzzy if-then rules called fuzzy attribute
implications parameterized by systems of isotone Galois connections. The rules
express dependencies between fuzzy attributes in object-attribute incidence
data. The proposed parameterizations are general and include as special cases
the parameterizati... | computer science |
20,128 | Towards a General Framework for Actual Causation Using CP-logic | cs.AI | Since Pearl's seminal work on providing a formal language for causality, the
subject has garnered a lot of interest among philosophers and researchers in
artificial intelligence alike. One of the most debated topics in this context
regards the notion of actual causation, which concerns itself with specific -
as opposed... | computer science |
20,129 | The probatilistic Quantifier Fuzzification Mechanism FA: A theoretical
analysis | cs.AI | The main goal of this work is to analyze the behaviour of the FA quantifier
fuzzification mechanism. As we prove in the paper, this model has a very solid
theorethical behaviour, superior to most of the models defined in the
literature. Moreover, we show that the underlying probabilistic interpretation
has very interes... | computer science |
20,130 | A mutli-thread tabu search algorithm | cs.AI | This paper describes a novel refinement to a Tabu search algorithm that has
been implemented in an attempt to improve the robustness of the search when
applied to particularly complex problems. In this approach, two Tabu searches
are carried out in parallel. Each search thread is characterised by it's own
short term me... | computer science |
20,131 | Reasoning for ALCQ extended with a flexible meta-modelling hierarchy | cs.AI | This works is motivated by a real-world case study where it is necessary to
integrate and relate existing ontologies through meta- modelling. For this, we
introduce the Description Logic ALCQM which is obtained from ALCQ by adding
statements that equate individuals to concepts in a knowledge base. In this new
extension... | computer science |
20,132 | Do Artificial Reinforcement-Learning Agents Matter Morally? | cs.AI | Artificial reinforcement learning (RL) is a widely used technique in
artificial intelligence that provides a general method for training agents to
perform a wide variety of behaviours. RL as used in computer science has
striking parallels to reward and punishment learning in animal and human
brains. I argue that presen... | computer science |
20,133 | Surrogate Search As a Way to Combat Harmful Effects of Ill-behaved
Evaluation Functions | cs.AI | Recently, several researchers have found that cost-based satisficing search
with A* often runs into problems. Although some "work arounds" have been
proposed to ameliorate the problem, there has been little concerted effort to
pinpoint its origin. In this paper, we argue that the origins of this problem
can be traced b... | computer science |
20,134 | NESTA, The NICTA Energy System Test Case Archive | cs.AI | In recent years the power systems research community has seen an explosion of
work applying operations research techniques to challenging power network
optimization problems. Regardless of the application under consideration, all
of these works rely on power system test cases for evaluation and validation.
However, man... | computer science |
20,135 | GC-SROIQ(C) : Expressive Constraint Modelling and Grounded
Circumscription for SROIQ | cs.AI | Developments in semantic web technologies have promoted ontological encoding
of knowledge from diverse domains. However, modelling many practical domains
requires more expressive representations schemes than what the standard
description logics(DLs) support. We extend the DL SROIQ with constraint
networks and grounded ... | computer science |
20,136 | Modelling serendipity in a computational context | cs.AI | Building on a survey of previous theories of serendipity and creativity, we
advance a sequential model of serendipitous occurrences. We distinguish between
serendipity as a service and serendipity in the system itself, clarify the role
of invention and discovery, and provide a measure for the serendipity potential
of a... | computer science |
20,137 | A Heuristic Method for Solving the Problem of Partitioning Graphs with
Supply and Demand | cs.AI | In this paper we present a greedy algorithm for solving the problem of the
maximum partitioning of graphs with supply and demand (MPGSD). The goal of the
method is to solve the MPGSD for large graphs in a reasonable time limit. This
is done by using a two stage greedy algorithm, with two corresponding types of
heuristi... | computer science |
20,138 | Ethical Artificial Intelligence | cs.AI | This book-length article combines several peer reviewed papers and new
material to analyze the issues of ethical artificial intelligence (AI). The
behavior of future AI systems can be described by mathematical equations, which
are adapted to analyze possible unintended AI behaviors and ways that AI
designs can avoid th... | computer science |
20,139 | The Spaces of Data, Information, and Knowledge | cs.AI | We study the data space $D$ of any given data set $X$ and explain how
functions and relations are defined over $D$. From $D$ and for a specific
domain $\Delta$ we construct the information space $I$ of $X$ by interpreting
variables, functions, and explicit relations over $D$ in $\Delta$ and by
including other relations... | computer science |
20,140 | The Limitations of Standardized Science Tests as Benchmarks for
Artificial Intelligence Research: Position Paper | cs.AI | In this position paper, I argue that standardized tests for elementary
science such as SAT or Regents tests are not very good benchmarks for measuring
the progress of artificial intelligence systems in understanding basic science.
The primary problem is that these tests are designed to test aspects of
knowledge and abi... | computer science |
20,141 | Membership Function Assignment for Elements of Single OWL Ontology | cs.AI | This paper develops the idea of membership function assignment for OWL (Web
Ontology Language) ontology elements in order to subsequently generate fuzzy
rules from this ontology. The task of membership function assignment for OWL
ontology elements had already been partially described, but this concerned the
case, when ... | computer science |
20,142 | Optimal Cost Almost-sure Reachability in POMDPs | cs.AI | We consider partially observable Markov decision processes (POMDPs) with a
set of target states and every transition is associated with an integer cost.
The optimization objective we study asks to minimize the expected total cost
till the target set is reached, while ensuring that the target set is reached
almost-surel... | computer science |
20,143 | Automatic Generation of Alternative Starting Positions for Simple
Traditional Board Games | cs.AI | Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role
not only in the development of mathematical and logical skills, but also in the
emotional and social development. In this paper, we address the problem of
generating targeted starting positions for such games. This can facilitate new
approaches ... | computer science |
20,144 | Using Description Logics for RDF Constraint Checking and Closed-World
Recognition | cs.AI | RDF and Description Logics work in an open-world setting where absence of
information is not information about absence. Nevertheless, Description Logic
axioms can be interpreted in a closed-world setting and in this setting they
can be used for both constraint checking and closed-world recognition against
information s... | computer science |
20,145 | Introduction to ROSS: A New Representational Scheme | cs.AI | ROSS ("Representation, Ontology, Structure, Star") is introduced as a new
method for knowledge representation that emphasizes representational constructs
for physical structure. The ROSS representational scheme includes a language
called "Star" for the specification of ontology classes. The ROSS method also
includes a ... | computer science |
20,146 | A Note on Systematic Conflict Generation in CA-EN-type Causal Structures | cs.AI | This paper is aimed at providing a very first, more "global", systematic
point of view with respect to possible conflict generation in CA-EN-like causal
structures. For simplicity, only the outermost level of graphs is taken into
account. Localization of the "conflict area", diagnostic preferences, and bases
for system... | computer science |
20,147 | Automated Reasoning in Deontic Logic | cs.AI | Deontic logic is a very well researched branch of mathematical logic and
philosophy. Various kinds of deontic logics are discussed for different
application domains like argumentation theory, legal reasoning, and acts in
multi-agent systems. In this paper, we show how standard deontic logic can be
stepwise transformed ... | computer science |
20,148 | Stable Model Counting and Its Application in Probabilistic Logic
Programming | cs.AI | Model counting is the problem of computing the number of models that satisfy
a given propositional theory. It has recently been applied to solving inference
tasks in probabilistic logic programming, where the goal is to compute the
probability of given queries being true provided a set of mutually independent
random va... | computer science |
20,149 | Recommending the Most Encompassing Opposing and Endorsing Arguments in
Debates | cs.AI | Arguments are essential objects in DirectDemocracyP2P, where they can occur
both in association with signatures for petitions, or in association with other
debated decisions, such as bug sorting by importance. The arguments of a signer
on a given issue are grouped into one single justification, are classified by
the ty... | computer science |
20,150 | Justifying Answer Sets using Argumentation | cs.AI | An answer set is a plain set of literals which has no further structure that
would explain why certain literals are part of it and why others are not. We
show how argumentation theory can help to explain why a literal is or is not
contained in a given answer set by defining two justification methods, both of
which make... | computer science |
20,151 | Discrete Bayesian Networks: The Exact Posterior Marginal Distributions | cs.AI | In a Bayesian network, we wish to evaluate the marginal probability of a
query variable, which may be conditioned on the observed values of some
evidence variables. Here we first present our "border algorithm," which
converts a BN into a directed chain. For the polytrees, we then present in
details, with some modificat... | computer science |
20,152 | Rational Deployment of Multiple Heuristics in IDA* | cs.AI | Recent advances in metareasoning for search has shown its usefulness in
improving numerous search algorithms. This paper applies rational metareasoning
to IDA* when several admissible heuristics are available. The obvious basic
approach of taking the maximum of the heuristics is improved upon by lazy
evaluation of the ... | computer science |
20,153 | A Fuzzy Syllogistic Reasoning Schema for Generalized Quantifiers | cs.AI | In this paper, a new approximate syllogistic reasoning schema is described
that expands some of the approaches expounded in the literature into two ways:
(i) a number of different types of quantifiers (logical, absolute,
proportional, comparative and exception) taken from Theory of Generalized
Quantifiers and similarit... | computer science |
20,154 | Unweighted Stochastic Local Search can be Effective for Random CSP
Benchmarks | cs.AI | We present ULSA, a novel stochastic local search algorithm for random binary
constraint satisfaction problems (CSP). ULSA is many times faster than the
prior state of the art on a widely-studied suite of random CSP benchmarks.
Unlike the best previous methods for these benchmarks, ULSA is a simple
unweighted method tha... | computer science |
20,155 | On the analysis of set-based fuzzy quantified reasoning using classical
syllogistics | cs.AI | Syllogism is a type of deductive reasoning involving quantified statements.
The syllogistic reasoning scheme in the classical Aristotelian framework
involves three crisp term sets and four linguistic quantifiers, for which the
main support is the linguistic properties of the quantifiers. A number of fuzzy
approaches fo... | computer science |
20,156 | Lifted Probabilistic Inference for Asymmetric Graphical Models | cs.AI | Lifted probabilistic inference algorithms have been successfully applied to a
large number of symmetric graphical models. Unfortunately, the majority of
real-world graphical models is asymmetric. This is even the case for relational
representations when evidence is given. Therefore, more recent work in the
community mo... | computer science |
20,157 | Semantic HMC for Big Data Analysis | cs.AI | Analyzing Big Data can help corporations to im-prove their efficiency. In
this work we present a new vision to derive Value from Big Data using a
Semantic Hierarchical Multi-label Classification called Semantic HMC based in a
non-supervised Ontology learning process. We also proposea Semantic HMC
process, using scalabl... | computer science |
20,158 | Problem Theory | cs.AI | The Turing machine, as it was presented by Turing himself, models the
calculations done by a person. This means that we can compute whatever any
Turing machine can compute, and therefore we are Turing complete. The question
addressed here is why, Why are we Turing complete? Being Turing complete also
means that somehow... | computer science |
20,159 | A Portfolio Approach to Algorithm Selection for Discrete Time-Cost
Trade-off Problem | cs.AI | It is a known fact that the performance of optimization algorithms for
NP-Hard problems vary from instance to instance. We observed the same trend
when we comprehensively studied multi-objective evolutionary algorithms (MOEAs)
on a six benchmark instances of discrete time-cost trade-off problem (DTCTP) in
a constructio... | computer science |
20,160 | Chases and Escapes, and Optimization Problems | cs.AI | We propose a new approach for solving combinatorial optimization problem by
utilizing the mechanism of chases and escapes, which has a long history in
mathematics. In addition to the well-used steepest descent and neighboring
search, we perform a chase and escape game on the "landscape" of the cost
function. We have cr... | computer science |
20,161 | Cause, Responsibility, and Blame: oA Structural-Model Approach | cs.AI | A definition of causality introduced by Halpern and Pearl, which uses
structural equations, is reviewed. A more refined definition is then
considered, which takes into account issues of normality and typicality, which
are well known to affect causal ascriptions. Causality is typically an
all-or-nothing notion: either A... | computer science |
20,162 | The Computational Complexity of Structure-Based Causality | cs.AI | Halpern and Pearl introduced a definition of actual causality; Eiter and
Lukasiewicz showed that computing whether X=x is a cause of Y=y is NP-complete
in binary models (where all variables can take on only two values) and\
Sigma_2^P-complete in general models. In the final version of their paper,
Halpern and Pearl sli... | computer science |
20,163 | Rule reasoning for legal norm validation of FSTP facts | cs.AI | Non-obviousness or inventive step is a general requirement for patentability
in most patent law systems. An invention should be at an adequate distance
beyond its prior art in order to be patented. This short paper provides an
overview on a methodology proposed for legal norm validation of FSTP facts
using rule reasoni... | computer science |
20,164 | The category of networks of ontologies | cs.AI | The semantic web has led to the deployment of ontologies on the web connected
through various relations and, in particular, alignments of their vocabularies.
There exists several semantics for alignments which make difficult
interoperation between different interpretation of networks of ontologies. Here
we present an a... | computer science |
20,165 | Appropriate Causal Models and the Stability of Causation | cs.AI | Causal models defined in terms of structural equations have proved to be
quite a powerful way of representing knowledge regarding causality. However, a
number of authors have given examples that seem to show that the Halpern-Pearl
(HP) definition of causality gives intuitively unreasonable answers. Here it is
shown tha... | computer science |
20,166 | Turing Test for the Internet of Things | cs.AI | How smart is your kettle? How smart are things in your kitchen, your house,
your neighborhood, on the internet? With the advent of Internet of Things, and
the move of making devices `smart' by utilizing AI, a natural question arrises,
how can we evaluate the progress. The standard way of evaluating AI is through
the Tu... | computer science |
20,167 | Belief revision in the propositional closure of a qualitative algebra | cs.AI | Belief revision is an operation that aims at modifying old be-liefs so that
they become consistent with new ones. The issue of belief revision has been
studied in various formalisms, in particular, in qualitative algebras (QAs) in
which the result is a disjunction of belief bases that is not necessarily
repre-sentable ... | computer science |
20,168 | Generating Graphical Chain by Mutual Matching of Bayesian Network and
Extracted Rules of Bayesian Network Using Genetic Algorithm | cs.AI | With the technology development, the need of analyze and extraction of useful
information is increasing. Bayesian networks contain knowledge from data and
experts that could be used for decision making processes But they are not
easily understandable thus the rule extraction methods have been used but they
have high co... | computer science |
20,169 | Neutrosophic information in the framework of multi-valued representation | cs.AI | The paper presents some steps for multi-valued representation of neutrosophic
information. These steps are provided in the framework of multi-valued logics
using the following logical value: true, false, neutral, unknown and saturated.
Also, this approach provides some calculus formulae for the following
neutrosophic f... | computer science |
20,170 | Max-Product Belief Propagation for Linear Programming: Applications to
Combinatorial Optimization | cs.AI | The max-product {belief propagation} (BP) is a popular message-passing
heuristic for approximating a maximum-a-posteriori (MAP) assignment in a joint
distribution represented by a graphical model (GM). In the past years, it has
been shown that BP can solve a few classes of linear programming (LP)
formulations to combin... | computer science |
20,171 | A Multi-criteria neutrosophic group decision making metod based TOPSIS
for supplier selection | cs.AI | The process of multiple criteria decision making (MCDM) is of determining the
best choice among all of the probable alternatives. The problem of supplier
selection on which decision maker has usually vague and imprecise knowledge is
a typical example of multi criteria group decision-making problem. The
conventional cri... | computer science |
20,172 | Multi-criteria neutrosophic decision making method based on score and
accuracy functions under neutrosophic environment | cs.AI | A neutrosophic set is a more general platform, which can be used to present
uncertainty, imprecise, incomplete and inconsistent. In this paper a score
function and an accuracy function for single valued neutrosophic sets is
firstly proposed to make the distinction between them. Then the idea is
extended to interval neu... | computer science |
20,173 | GraATP: A Graph Theoretic Approach for Automated Theorem Proving in
Plane Geometry | cs.AI | Automated Theorem Proving (ATP) is an established branch of Artificial
Intelligence. The purpose of ATP is to design a system which can automatically
figure out an algorithm either to prove or disprove a mathematical claim, on
the basis of a set of given premises, using a set of fundamental postulates and
following the... | computer science |
20,174 | Stochastic Local Search for Pattern Set Mining | cs.AI | Local search methods can quickly find good quality solutions in cases where
systematic search methods might take a large amount of time. Moreover, in the
context of pattern set mining, exhaustive search methods are not applicable due
to the large search space they have to explore. In this paper, we propose the
applicat... | computer science |
20,175 | Towards a Consistent, Sound and Complete Conceptual Knowledge | cs.AI | Knowledge is only good if it is sound, consistent and complete. The same
holds true for conceptual knowledge, which holds knowledge about concepts and
its association. Conceptual knowledge no matter what format they are
represented in, must be consistent, sound and complete in order to realise its
practical use. This p... | computer science |
20,176 | Decision-theoretic rough sets-based three-way approximations of
interval-valued fuzzy sets | cs.AI | In practical situations, interval-valued fuzzy sets are frequently
encountered. In this paper, firstly, we present shadowed sets for interpreting
and understanding interval fuzzy sets. We also provide an analytic solution to
computing the pair of thresholds by searching for a balance of uncertainty in
the framework of ... | computer science |
20,177 | Converting Instance Checking to Subsumption: A Rethink for Object
Queries over Practical Ontologies | cs.AI | Efficiently querying Description Logic (DL) ontologies is becoming a vital
task in various data-intensive DL applications. Considered as a basic service
for answering object queries over DL ontologies, instance checking can be
realized by using the most specific concept (MSC) method, which converts
instance checking in... | computer science |
20,178 | Reasoning for Improved Sensor Data Interpretation in a Smart Home | cs.AI | In this paper an ontological representation and reasoning paradigm has been
proposed for interpretation of time-series signals. The signals come from
sensors observing a smart environment. The signal chosen for the annotation
process is a set of unintuitive and complex gas sensor data. The ontology of
this paradigm is ... | computer science |
20,179 | Knowledge Propagation in Contextualized Knowledge Repositories: an
Experimental Evaluation | cs.AI | As the interest in the representation of context dependent knowledge in the
Semantic Web has been recognized, a number of logic based solutions have been
proposed in this regard. In our recent works, in response to this need, we
presented the description logic-based Contextualized Knowledge Repository (CKR)
framework. ... | computer science |
20,180 | Adding Context to Knowledge and Action Bases | cs.AI | Knowledge and Action Bases (KABs) have been recently proposed as a formal
framework to capture the dynamics of systems which manipulate Description Logic
(DL) Knowledge Bases (KBs) through action execution. In this work, we enrich
the KAB setting with contextual information, making use of different context
dimensions. ... | computer science |
20,181 | Different Types of Conflicting Knowledge in AmI Environments | cs.AI | We characterize different types of conflicts that may occur in complex
distributed multi-agent scenarios, such as in Ambient Intelligence (AmI)
environments, and we argue that these conflicts should be resolved in a
suitable order and with the appropriate strategies for each individual conflict
type. We call for furthe... | computer science |
20,182 | Context-Aware Analytics in MOM Applications | cs.AI | Manufacturing Operations Management (MOM) systems are complex in the sense
that they integrate data from heterogeneous systems inside the automation
pyramid. The need for context-aware analytics arises from the dynamics of these
systems that influence data generation and hamper comparability of analytics,
especially pr... | computer science |
20,183 | A note about the generalisation of the C-tests | cs.AI | In this exploratory note we ask the question of what a measure of performance
for all tasks is like if we use a weighting of tasks based on a difficulty
function. This difficulty function depends on the complexity of the
(acceptable) solution for the task (instead of a universal distribution over
tasks or an adaptive t... | computer science |
20,184 | Workshop Notes of the 6th International Workshop on Acquisition,
Representation and Reasoning about Context with Logic (ARCOE-Logic 2014) | cs.AI | ARCOE-Logic 2014, the 6th International Workshop on Acquisition,
Representation and Reasoning about Context with Logic, was held in co-location
with the 19th International Conference on Knowledge Engineering and Knowledge
Management (EKAW 2014) on November 25, 2014 in Link\"oping, Sweden. These notes
contain the five p... | computer science |
20,185 | Ultimate Intelligence Part I: Physical Completeness and Objectivity of
Induction | cs.AI | We propose that Solomonoff induction is complete in the physical sense via
several strong physical arguments. We also argue that Solomonoff induction is
fully applicable to quantum mechanics. We show how to choose an objective
reference machine for universal induction by defining a physical message
complexity and physi... | computer science |
20,186 | Constraint-based sequence mining using constraint programming | cs.AI | The goal of constraint-based sequence mining is to find sequences of symbols
that are included in a large number of input sequences and that satisfy some
constraints specified by the user. Many constraints have been proposed in the
literature, but a general framework is still missing. We investigate the use of
constrai... | computer science |
20,187 | Predicting Performance During Tutoring with Models of Recent Performance | cs.AI | In educational technology and learning sciences, there are multiple uses for
a predictive model of whether a student will perform a task correctly or not.
For example, an intelligent tutoring system may use such a model to estimate
whether or not a student has mastered a skill. We analyze the significance of
data recen... | computer science |
20,188 | Holographic Graph Neuron: a Bio-Inspired Architecture for Pattern
Processing | cs.AI | This article proposes the use of Vector Symbolic Architectures for
implementing Hierarchical Graph Neuron, an architecture for memorizing patterns
of generic sensor stimuli. The adoption of a Vector Symbolic representation
ensures a one-layered design for the approach, while maintaining the previously
reported properti... | computer science |
20,189 | Second International Nurse Rostering Competition (INRC-II) --- Problem
Description and Rules --- | cs.AI | In this paper, we provide all information to participate to the Second
International Nurse Rostering Competition (INRC-II). First, we describe the
problem formulation, which, differently from INRC-I, is a multi-stage
procedure. Second, we illustrate all the necessary infrastructure do be used
together with the particip... | computer science |
20,190 | The Information-theoretic and Algorithmic Approach to Human, Animal and
Artificial Cognition | cs.AI | We survey concepts at the frontier of research connecting artificial, animal
and human cognition to computation and information processing---from the Turing
test to Searle's Chinese Room argument, from Integrated Information Theory to
computational and algorithmic complexity. We start by arguing that passing the
Turing... | computer science |
20,191 | Consid{é}rant la d{é}pendance dans la th{é}orie des fonctions de
croyance | cs.AI | In this paper, we propose to learn sources independence in order to choose
the appropriate type of combination rules when aggregating their beliefs. Some
combination rules are used with the assumption of their sources independence
whereas others combine beliefs of dependent sources. Therefore, the choice of
the combina... | computer science |
20,192 | Trolls Identification within an Uncertain Framework | cs.AI | The web plays an important role in people's social lives since the emergence
of Web 2.0. It facilitates the interaction between users, gives them the
possibility to freely interact, share and collaborate through social networks,
online communities forums, blogs, wikis and other online collaborative media.
However, an o... | computer science |
20,193 | Belief Hidden Markov Model for speech recognition | cs.AI | Speech Recognition searches to predict the spoken words automatically. These
systems are known to be very expensive because of using several pre-recorded
hours of speech. Hence, building a model that minimizes the cost of the
recognizer will be very interesting. In this paper, we present a new approach
for recognizing ... | computer science |
20,194 | Features modeling with an $α$-stable distribution: Application to
pattern recognition based on continuous belief functions | cs.AI | The aim of this paper is to show the interest in fitting features with an
$\alpha$-stable distribution to classify imperfect data. The supervised pattern
recognition is thus based on the theory of continuous belief functions, which
is a way to consider imprecision and uncertainty of data. The distributions of
features ... | computer science |
20,195 | Second-Order Belief Hidden Markov Models | cs.AI | Hidden Markov Models (HMMs) are learning methods for pattern recognition. The
probabilistic HMMs have been one of the most used techniques based on the
Bayesian model. First-order probabilistic HMMs were adapted to the theory of
belief functions such that Bayesian probabilities were replaced with mass
functions. In thi... | computer science |
20,196 | Int{é}gration d'une mesure d'ind{é}pendance pour la fusion
d'informations | cs.AI | Many information sources are considered into data fusion in order to improve
the decision in terms of uncertainty and imprecision. For each technique used
for data fusion, the asumption on independance is usually made. We propose in
this article an approach to take into acount an independance measure befor to
make the ... | computer science |
20,197 | Uncertainty in Ontology Matching: A Decision Rule-Based Approach | cs.AI | Considering the high heterogeneity of the ontologies pub-lished on the web,
ontology matching is a crucial issue whose aim is to establish links between an
entity of a source ontology and one or several entities from a target ontology.
Perfectible similarity measures, consid-ered as sources of information, are
combined... | computer science |
20,198 | Efficient local search limitation strategy for single machine total
weighted tardiness scheduling with sequence-dependent setup times | cs.AI | This paper concerns the single machine total weighted tardiness scheduling
with sequence-dependent setup times, usually referred as $1|s_{ij}|\sum
w_jT_j$. In this $\mathcal{NP}$-hard problem, each job has an associated
processing time, due date and a weight. For each pair of jobs $i$ and $j$,
there may be a setup time... | computer science |
20,199 | On Generalized Rectangular Fuzzy Model for Assessment | cs.AI | The article is dedicated to the analysis of the existing models for
assessment based of the fuzzy logic centroid technique. A new Generalized
Rectangular Model were developed. Some generalizations of the existing models
are offered. | computer science |
20,200 | Inclusion within Continuous Belief Functions | cs.AI | Defining and modeling the relation of inclusion between continuous belief
function may be considered as an important operation in order to study their
behaviors. Within this paper we will propose and present two forms of
inclusion: The strict and the partial one. In order to develop this relation,
we will study the cas... | computer science |
20,201 | A Distance-Based Decision in the Credal Level | cs.AI | Belief function theory provides a flexible way to combine information
provided by different sources. This combination is usually followed by a
decision making which can be handled by a range of decision rules. Some rules
help to choose the most likely hypothesis. Others allow that a decision is made
on a set of hypothe... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.