Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,606 | Electronic Geometry Textbook: A Geometric Textbook Knowledge Management
System | cs.AI | Electronic Geometry Textbook is a knowledge management system that manages
geometric textbook knowledge to enable users to construct and share dynamic
geometry textbooks interactively and efficiently. Based on a knowledge base
organizing and storing the knowledge represented in specific languages, the
system implements... | computer science |
35,607 | The Production of Probabilistic Entropy in Structure/Action Contingency
Relations | cs.AI | Luhmann (1984) defined society as a communication system which is
structurally coupled to, but not an aggregate of, human action systems. The
communication system is then considered as self-organizing ("autopoietic"), as
are human actors. Communication systems can be studied by using Shannon's
(1948) mathematical theor... | computer science |
35,608 | On The Power of Tree Projections: Structural Tractability of Enumerating
CSP Solutions | cs.AI | The problem of deciding whether CSP instances admit solutions has been deeply
studied in the literature, and several structural tractability results have
been derived so far. However, constraint satisfaction comes in practice as a
computation problem where the focus is either on finding one solution, or on
enumerating ... | computer science |
35,609 | Heuristics in Conflict Resolution | cs.AI | Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming
(ASP) are based on sophisticated Boolean constraint solving techniques. In both
areas, conflict-driven learning and related techniques constitute key features
whose application is enabled by conflict analysis. Although various conflict
analysis ... | computer science |
35,610 | Scalable Probabilistic Databases with Factor Graphs and MCMC | cs.DB | Probabilistic databases play a crucial role in the management and
understanding of uncertain data. However, incorporating probabilities into the
semantics of incomplete databases has posed many challenges, forcing systems to
sacrifice modeling power, scalability, or restrict the class of relational
algebra formula unde... | computer science |
35,611 | Evidence Algorithm and System for Automated Deduction: A Retrospective
View | cs.AI | A research project aimed at the development of an automated theorem proving
system was started in Kiev (Ukraine) in early 1960s. The mastermind of the
project, Academician V.Glushkov, baptized it "Evidence Algorithm", EA. The work
on the project lasted, off and on, more than 40 years. In the framework of the
project, t... | computer science |
35,612 | Failover in cellular automata | cs.AI | A cellular automata (CA) configuration is constructed that exhibits emergent
failover. The configuration is based on standard Game of Life rules. Gliders
and glider-guns form the core messaging structure in the configuration. The
blinker is represented as the basic computational unit, and it is shown how it
can be recr... | computer science |
35,613 | Métodos para la Selección y el Ajuste de Características en
el Problema de la Detección de Spam | cs.IR | The email is used daily by millions of people to communicate around the globe
and it is a mission-critical application for many businesses. Over the last
decade, unsolicited bulk email has become a major problem for email users. An
overwhelming amount of spam is flowing into users' mailboxes daily. In 2004, an
estimate... | computer science |
35,614 | Begin, After, and Later: a Maximal Decidable Interval Temporal Logic | cs.LO | Interval temporal logics (ITLs) are logics for reasoning about temporal
statements expressed over intervals, i.e., periods of time. The most famous ITL
studied so far is Halpern and Shoham's HS, which is the logic of the thirteen
Allen's interval relations. Unfortunately, HS and most of its fragments have an
undecidabl... | computer science |
35,615 | New worst upper bound for #SAT | cs.AI | The rigorous theoretical analyses of algorithms for #SAT have been proposed
in the literature. As we know, previous algorithms for solving #SAT have been
analyzed only regarding the number of variables as the parameter. However, the
time complexity for solving #SAT instances depends not only on the number of
variables,... | computer science |
35,616 | Measuring interesting rules in Characteristic rule | cs.DB | Finding interesting rule in the sixth strategy step about threshold control
on generalized relations in attribute oriented induction, there is possibility
to select candidate attribute for further generalization and merging of
identical tuples until the number of tuples is no greater than the threshold
value, as implem... | computer science |
35,617 | Building Computer Network Attacks | cs.CR | In this work we start walking the path to a new perspective for viewing
cyberwarfare scenarios, by introducing conceptual tools (a formal model) to
evaluate the costs of an attack, to describe the theater of operations,
targets, missions, actions, plans and assets involved in cyberwarfare attacks.
We also describe two ... | computer science |
35,618 | Unification in the Description Logic EL | cs.AI | The Description Logic EL has recently drawn considerable attention since, on
the one hand, important inference problems such as the subsumption problem are
polynomial. On the other hand, EL is used to define large biomedical
ontologies. Unification in Description Logics has been proposed as a novel
inference service th... | computer science |
35,619 | Mirrored Language Structure and Innate Logic of the Human Brain as a
Computable Model of the Oracle Turing Machine | cs.LO | We wish to present a mirrored language structure (MLS) and four logic rules
determined by this structure for the model of a computable Oracle Turing
machine. MLS has novel features that are of considerable biological and
computational significance. It suggests an algorithm of relation learning and
recognition (RLR) tha... | computer science |
35,620 | From RESTful Services to RDF: Connecting the Web and the Semantic Web | cs.AI | RESTful services on the Web expose information through retrievable resource
representations that represent self-describing descriptions of resources, and
through the way how these resources are interlinked through the hyperlinks that
can be found in those representations. This basic design of RESTful services
means tha... | computer science |
35,621 | Products of Weighted Logic Programs | cs.AI | Weighted logic programming, a generalization of bottom-up logic programming,
is a well-suited framework for specifying dynamic programming algorithms. In
this setting, proofs correspond to the algorithm's output space, such as a path
through a graph or a grammatical derivation, and are given a real-valued score
(often ... | computer science |
35,622 | Functional Answer Set Programming | cs.LO | In this paper we propose an extension of Answer Set Programming (ASP), and in
particular, of its most general logical counterpart, Quantified Equilibrium
Logic (QEL), to deal with partial functions. Although the treatment of equality
in QEL can be established in different ways, we first analyse the choice of
decidable ... | computer science |
35,623 | sTeX+ - a System for Flexible Formalization of Linked Data | cs.SE | We present the sTeX+ system, a user-driven advancement of sTeX - a semantic
extension of LaTeX that allows for producing high-quality PDF documents for
(proof)reading and printing, as well as semantic XML/OMDoc documents for the
Web or further processing. Originally sTeX had been created as an invasive,
semantic fronte... | computer science |
35,624 | Automatic Music Composition using Answer Set Programming | cs.LO | Music composition used to be a pen and paper activity. These these days music
is often composed with the aid of computer software, even to the point where
the computer compose parts of the score autonomously. The composition of most
styles of music is governed by rules. We show that by approaching the
automation, analy... | computer science |
35,625 | Counterexample Guided Abstraction Refinement Algorithm for Propositional
Circumscription | cs.AI | Circumscription is a representative example of a nonmonotonic reasoning
inference technique. Circumscription has often been studied for first order
theories, but its propositional version has also been the subject of extensive
research, having been shown equivalent to extended closed world assumption
(ECWA). Moreover, ... | computer science |
35,626 | Not only a lack of right definitions: Arguments for a shift in
information-processing paradigm | cs.AI | Machine Consciousness and Machine Intelligence are not simply new buzzwords
that occupy our imagination. Over the last decades, we witness an unprecedented
rise in attempts to create machines with human-like features and capabilities.
However, despite widespread sympathy and abundant funding, progress in these
enterpri... | computer science |
35,627 | Parameterized Complexity Results in Symmetry Breaking | cs.AI | Symmetry is a common feature of many combinatorial problems. Unfortunately
eliminating all symmetry from a problem is often computationally intractable.
This paper argues that recent parameterized complexity results provide insight
into that intractability and help identify special cases in which symmetry can
be dealt ... | computer science |
35,628 | Is there a physically universal cellular automaton or Hamiltonian? | cs.AI | It is known that both quantum and classical cellular automata (CA) exist that
are computationally universal in the sense that they can simulate, after
appropriate initialization, any quantum or classical computation, respectively.
Here we introduce a different notion of universality: a CA is called physically
universal... | computer science |
35,629 | The Complexity of Causality and Responsibility for Query Answers and
non-Answers | cs.DB | An answer to a query has a well-defined lineage expression (alternatively
called how-provenance) that explains how the answer was derived. Recent work
has also shown how to compute the lineage of a non-answer to a query. However,
the cause of an answer or non-answer is a more subtle notion and consists, in
general, of ... | computer science |
35,630 | Ontology Temporal Evolution for Multi-Entity Bayesian Networks under
Exogenous and Endogenous Semantic Updating | cs.AI | It is a challenge for any Knowledge Base reasoning to manage ubiquitous
uncertain ontology as well as uncertain updating times, while achieving
acceptable service levels at minimum computational cost. This paper proposes an
application-independent merging ontologies for any open interaction system. A
solution that uses... | computer science |
35,631 | A Novel Approach for Cardiac Disease Prediction and Classification Using
Intelligent Agents | cs.MA | The goal is to develop a novel approach for cardiac disease prediction and
diagnosis using intelligent agents. Initially the symptoms are preprocessed
using filter and wrapper based agents. The filter removes the missing or
irrelevant symptoms. Wrapper is used to extract the data in the data set
according to the thresh... | computer science |
35,632 | A Comprehensive Survey of Data Mining-based Fraud Detection Research | cs.AI | This survey paper categorises, compares, and summarises from almost all
published technical and review articles in automated fraud detection within the
last 10 years. It defines the professional fraudster, formalises the main types
and subtypes of known fraud, and presents the nature of data evidence collected
within a... | computer science |
35,633 | Efficient Knowledge Base Management in DCSP | cs.AI | DCSP (Distributed Constraint Satisfaction Problem) has been a very important
research area in AI (Artificial Intelligence). There are many application
problems in distributed AI that can be formalized as DSCPs. With the increasing
complexity and problem size of the application problems in AI, the required
storage place... | computer science |
35,634 | Probabilistic Inferences in Bayesian Networks | cs.AI | Bayesian network is a complete model for the variables and their
relationships, it can be used to answer probabilistic queries about them. A
Bayesian network can thus be considered a mechanism for automatically applying
Bayes' theorem to complex problems. In the application of Bayesian networks,
most of the work is rel... | computer science |
35,635 | Fundamentals of Mathematical Theory of Emotional Robots | cs.RO | In this book we introduce a mathematically formalized concept of emotion,
robot's education and other psychological parameters of intelligent robots. We
also introduce unitless coefficients characterizing an emotional memory of a
robot. Besides, the effect of a robot's memory upon its emotional behavior is
studied, and... | computer science |
35,636 | Photometric Catalogue of Quasars and Other Point Sources in the Sloan
Digital Sky Survey | cs.AI | We present a catalogue of about 6 million unresolved photometric detections
in the Sloan Digital Sky Survey Seventh Data Release classifying them into
stars, galaxies and quasars. We use a machine learning classifier trained on a
subset of spectroscopically confirmed objects from 14th to 22nd magnitude in
the SDSS {\it... | computer science |
35,637 | Reified unit resolution and the failed literal rule | cs.LO | Unit resolution can simplify a CNF formula or detect an inconsistency by
repeatedly assign the variables occurring in unit clauses. Given any CNF
formula sigma, we show that there exists a satisfiable CNF formula psi with
size polynomially related to the size of sigma such that applying unit
resolution to psi simulates... | computer science |
35,638 | Integration of Flexible Web Based GUI in I-SOAS | cs.HC | It is necessary to improve the concepts of the present web based graphical
user interface for the development of more flexible and intelligent interface
to provide ease and increase the level of comfort at user end like most of the
desktop based applications. This research is conducted targeting the goal of
implementin... | computer science |
35,639 | Optimizing real-time RDF data streams | cs.AI | The Resource Description Framework (RDF) provides a common data model for the
integration of "real-time" social and sensor data streams with the Web and with
each other. While there exist numerous protocols and data formats for
exchanging dynamic RDF data, or RDF updates, these options should be examined
carefully in o... | computer science |
35,640 | Random Projections for $k$-means Clustering | cs.AI | This paper discusses the topic of dimensionality reduction for $k$-means
clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a
matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$
dimensions, for any $\eps \in (0,1/3)$, in $O(n d \lceil \eps^{-2} k/ \log(d)
\rceil )$ ti... | computer science |
35,641 | A Logical Charaterisation of Ordered Disjunction | cs.LO | In this paper we consider a logical treatment for the ordered disjunction
operator 'x' introduced by Brewka, Niemel\"a and Syrj\"anen in their Logic
Programs with Ordered Disjunctions (LPOD). LPODs are used to represent
preferences in logic programming under the answer set semantics. Their
semantics is defined by first... | computer science |
35,642 | Covered Clause Elimination | cs.LO | Generalizing the novel clause elimination procedures developed in [M. Heule,
M. J\"arvisalo, and A. Biere. Clause elimination procedures for CNF formulas.
In Proc. LPAR-17, volume 6397 of LNCS, pages 357-371. Springer, 2010.], we
introduce explicit (CCE), hidden (HCCE), and asymmetric (ACCE) variants of a
procedure tha... | computer science |
35,643 | Argudas: arguing with gene expression information | cs.CE | In situ hybridisation gene expression information helps biologists identify
where a gene is expressed. However, the databases that republish the
experimental information are often both incomplete and inconsistent. This paper
examines a system, Argudas, designed to help tackle these issues. Argudas is an
evolution of an... | computer science |
35,644 | Analysis Of Cancer Omics Data In A Semantic Web Framework | cs.AI | Our work concerns the elucidation of the cancer (epi)genome, transcriptome
and proteome to better understand the complex interplay between a cancer cell's
molecular state and its response to anti-cancer therapy. To study the problem,
we have previously focused on data warehousing technologies and statistical
data integ... | computer science |
35,645 | First steps in the logic-based assessment of post-composed phenotypic
descriptions | cs.AI | In this paper we present a preliminary logic-based evaluation of the
integration of post-composed phenotypic descriptions with domain ontologies.
The evaluation has been performed using a description logic reasoner together
with scalable techniques: ontology modularization and approximations of the
logical difference b... | computer science |
35,646 | Analysis and visualisation of RDF resources in Ondex | cs.AI | Ondex is a data integration and visualization platform developed to support
Systems Biology Research. At its core is a data model based on two main
principles: first, all information can be represented as a graph and, second,
all elements of the graph can be annotated with ontologies. This data model is
conformant to t... | computer science |
35,647 | On the Implementation of GNU Prolog | cs.PL | GNU Prolog is a general-purpose implementation of the Prolog language, which
distinguishes itself from most other systems by being, above all else, a
native-code compiler which produces standalone executables which don't rely on
any byte-code emulator or meta-interpreter. Other aspects which stand out
include the expli... | computer science |
35,648 | Phase Transitions of Plan Modification in Conformant Planning | cs.AI | We explore phase transitions of plan modification, which mainly focus on the
conformant planning problems. By analyzing features of plan modification in
conformant planning problems, quantitative results are obtained. If the number
of operators is less than, almost all conformant planning problems can't be
solved with ... | computer science |
35,649 | To study the phenomenon of the Moravec's Paradox | cs.AI | "Encoded in the large, highly evolved sensory and motor portions of the human
brain is a billion years of experience about the nature of the world and how to
survive in it. The deliberate process we call reasoning is, I believe, the
thinnest veneer of human thought, effective only because it is supported by
this much o... | computer science |
35,650 | Data Conflict Resolution Using Trust Mappings | cs.DB | In massively collaborative projects such as scientific or community
databases, users often need to agree or disagree on the content of individual
data items. On the other hand, trust relationships often exist between users,
allowing them to accept or reject other users' beliefs by default. As those
trust relationships ... | computer science |
35,651 | On the CNF encoding of cardinality constraints and beyond | cs.AI | In this report, we propose a quick survey of the currently known techniques
for encoding a Boolean cardinality constraint into a CNF formula, and we
discuss about the relevance of these encodings. We also propose models to
facilitate analysis and design of CNF encodings for Boolean constraints. | computer science |
35,652 | Interpolation in Equilibrium Logic and Answer Set Programming: the
Propositional Case | cs.LO | Interpolation is an important property of classical and many non classical
logics that has been shown to have interesting applications in computer science
and AI. Here we study the Interpolation Property for the propositional version
of the non-monotonic system of equilibrium logic, establishing weaker or
stronger form... | computer science |
35,653 | The Ethics of Robotics | cs.AI | The three laws of Robotics first appeared together in Isaac Asimov's story
'Runaround' after being mentioned in some form or the other in previous works
by Asimov. These three laws commonly known as the three laws of robotics are
the earliest forms of depiction for the needs of ethics in Robotics. In
simplistic languag... | computer science |
35,654 | Software Effort Estimation with Ridge Regression and Evolutionary
Attribute Selection | cs.SE | Software cost estimation is one of the prerequisite managerial activities
carried out at the software development initiation stages and also repeated
throughout the whole software life-cycle so that amendments to the total cost
are made. In software cost estimation typically, a selection of project
attributes is employ... | computer science |
35,655 | DD-EbA: An algorithm for determining the number of neighbors in cost
estimation by analogy using distance distributions | cs.SE | Case Based Reasoning and particularly Estimation by Analogy, has been used in
a number of problem-solving areas, such as cost estimation. Conventional
methods, despite the lack of a sound criterion for choosing nearest projects,
were based on estimation using a fixed and predetermined number of neighbors
from the entir... | computer science |
35,656 | Neural Network Influence in Group Technology: A Chronological Survey and
Critical Analysis | cs.AI | This article portrays a chronological review of the influence of Artificial
Neural Network in group technology applications in the vicinity of Cellular
Manufacturing Systems. The research trend is identified and the evolvement is
captured through a critical analysis of the literature accessible from the very
beginning ... | computer science |
35,657 | Speeding up SAT solver by exploring CNF symmetries : Revisited | math.CO | Boolean Satisfiability solvers have gone through dramatic improvements in
their performances and scalability over the last few years by considering
symmetries. It has been shown that by using graph symmetries and generating
symmetry breaking predicates (SBPs) it is possible to break symmetries in
Conjunctive Normal For... | computer science |
35,658 | Evolutionary multiobjective optimization of the multi-location
transshipment problem | cs.AI | We consider a multi-location inventory system where inventory choices at each
location are centrally coordinated. Lateral transshipments are allowed as
recourse actions within the same echelon in the inventory system to reduce
costs and improve service level. However, this transshipment process usually
causes undesirab... | computer science |
35,659 | Proposing LT based Search in PDM Systems for Better Information
Retrieval | cs.IR | PDM Systems contain and manage heavy amount of data but the search mechanism
of most of the systems is not intelligent which can process user"s natural
language based queries to extract desired information. Currently available
search mechanisms in almost all of the PDM systems are not very efficient and
based on old wa... | computer science |
35,660 | Improving DPLL Solver Performance with Domain-Specific Heuristics: the
ASP Case | cs.AI | In spite of the recent improvements in the performance of the solvers based
on the DPLL procedure, it is still possible for the search algorithm to focus
on the wrong areas of the search space, preventing the solver from returning a
solution in an acceptable amount of time. This prospect is a real concern e.g.
in an in... | computer science |
35,661 | Linear Temporal Logic and Propositional Schemata, Back and Forth
(extended version) | cs.LO | This paper relates the well-known Linear Temporal Logic with the logic of
propositional schemata introduced by the authors. We prove that LTL is
equivalent to a class of schemata in the sense that polynomial-time reductions
exist from one logic to the other. Some consequences about complexity are
given. We report about... | computer science |
35,662 | Foundations for Understanding and Building Conscious Systems using
Stable Parallel Looped Dynamics | cs.AI | The problem of consciousness faced several challenges for a few reasons: (a)
a lack of necessary and sufficient conditions, without which we would not know
how close we are to the solution, (b) a lack of a synthesis framework to build
conscious systems and (c) a lack of mechanisms explaining the transition
between the ... | computer science |
35,663 | Counting Solutions of Constraint Satisfiability Problems:Exact Phase
Transitions and Approximate Algorithm | cs.AI | The study of phase transition phenomenon of NP complete problems plays an
important role in understanding the nature of hard problems. In this paper, we
follow this line of research by considering the problem of counting solutions
of Constraint Satisfaction Problems (#CSP). We consider the random model, i.e.
RB model. ... | computer science |
35,664 | Worst-Case Upper Bound for (1, 2)-QSAT | cs.AI | The rigorous theoretical analysis of the algorithm for a subclass of QSAT,
i.e. (1, 2)-QSAT, has been proposed in the literature. (1, 2)-QSAT, first
introduced in SAT'08, can be seen as quantified extended 2-CNF formulas. Until
now, within our knowledge, there exists no algorithm presenting the worst upper
bound for (1... | computer science |
35,665 | New Worst-Case Upper Bound for X3SAT | cs.AI | The rigorous theoretical analyses of algorithms for exact 3-satisfiability
(X3SAT) have been proposed in the literature. As we know, previous algorithms
for solving X3SAT have been analyzed only regarding the number of variables as
the parameter. However, the time complexity for solving X3SAT instances depends
not only... | computer science |
35,666 | Reduction of fuzzy automata by means of fuzzy quasi-orders | cs.FL | In our recent paper we have established close relationships between state
reduction of a fuzzy recognizer and resolution of a particular system of fuzzy
relation equations. In that paper we have also studied reductions by means of
those solutions which are fuzzy equivalences. In this paper we will see that in
some case... | computer science |
35,667 | Bisimulations for fuzzy automata | cs.FL | Bisimulations have been widely used in many areas of computer science to
model equivalence between various systems, and to reduce the number of states
of these systems, whereas uniform fuzzy relations have recently been introduced
as a means to model the fuzzy equivalence between elements of two possible
different sets... | computer science |
35,668 | Loopy Belief Propagation, Bethe Free Energy and Graph Zeta Function | cs.AI | We propose a new approach to the theoretical analysis of Loopy Belief
Propagation (LBP) and the Bethe free energy (BFE) by establishing a formula to
connect LBP and BFE with a graph zeta function. The proposed approach is
applicable to a wide class of models including multinomial and Gaussian types.
The connection deri... | computer science |
35,669 | Automatic Wrapper Adaptation by Tree Edit Distance Matching | cs.AI | Information distributed through the Web keeps growing faster day by day, and
for this reason, several techniques for extracting Web data have been suggested
during last years. Often, extraction tasks are performed through so called
wrappers, procedures extracting information from Web pages, e.g. implementing
logic-base... | computer science |
35,670 | Design of Automatically Adaptable Web Wrappers | cs.AI | Nowadays, the huge amount of information distributed through the Web
motivates studying techniques to be adopted in order to extract relevant data
in an efficient and reliable way. Both academia and enterprises developed
several approaches of Web data extraction, for example using techniques of
artificial intelligence ... | computer science |
35,671 | Climbing depth-bounded adjacent discrepancy search for solving hybrid
flow shop scheduling problems with multiprocessor tasks | cs.RO | This paper considers multiprocessor task scheduling in a multistage hybrid
flow-shop environment. The problem even in its simplest form is NP-hard in the
strong sense. The great deal of interest for this problem, besides its
theoretical complexity, is animated by needs of various manufacturing and
computing systems. We... | computer science |
35,672 | A Discrete Evolutionary Model for Chess Players' Ratings | cs.AI | The Elo system for rating chess players, also used in other games and sports,
was adopted by the World Chess Federation over four decades ago. Although not
without controversy, it is accepted as generally reliable and provides a method
for assessing players' strengths and ranking them in official tournaments.
It is g... | computer science |
35,673 | Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains | cs.AI | The state of the art in local search for the Traveling Salesman Problem is
dominated by ejection chain methods utilising the Stem-and-Cycle reference
structure. Though effective such algorithms employ very little information in
their successor selection strategy, typically seeking only to minimise the cost
of a move. W... | computer science |
35,674 | Representing First-Order Causal Theories by Logic Programs | cs.AI | Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner,
became a basis for the semantics of several expressive action languages.
McCain's embedding of definite propositional causal theories into logic
programming paved the way to the use of answer set solvers for answering
queries about actions descri... | computer science |
35,675 | Formal and Computational Properties of the Confidence Boost of
Association Rules | cs.DB | Some existing notions of redundancy among association rules allow for a
logical-style characterization and lead to irredundant bases of absolutely
minimum size. One can push the intuition of redundancy further and find an
intuitive notion of interest of an association rule, in terms of its "novelty"
with respect to oth... | computer science |
35,676 | Algorithms for computing the greatest simulations and bisimulations
between fuzzy automata | cs.FL | Recently, two types of simulations (forward and backward simulations) and
four types of bisimulations (forward, backward, forward-backward, and
backward-forward bisimulations) between fuzzy automata have been introduced. If
there is at least one simulation/bisimulation of some of these types between
the given fuzzy aut... | computer science |
35,677 | On the equivalence of Hopfield Networks and Boltzmann Machines | cs.AI | A specific type of neural network, the Restricted Boltzmann Machine (RBM), is
implemented for classification and feature detection in machine learning. RBM
is characterized by separate layers of visible and hidden units, which are able
to learn efficiently a generative model of the observed data. We study a
"hybrid" ve... | computer science |
35,678 | On A Semi-Automatic Method for Generating Composition Tables | cs.AI | Originating from Allen's Interval Algebra, composition-based reasoning has
been widely acknowledged as the most popular reasoning technique in qualitative
spatial and temporal reasoning. Given a qualitative calculus (i.e. a relation
model), the first thing we should do is to establish its composition table
(CT). In the... | computer science |
35,679 | Correction of Noisy Sentences using a Monolingual Corpus | cs.DL | Correction of Noisy Natural Language Text is an important and well studied
problem in Natural Language Processing. It has a number of applications in
domains like Statistical Machine Translation, Second Language Learning and
Natural Language Generation. In this work, we consider some statistical
techniques for Text Cor... | computer science |
35,680 | Activity-Based Search for Black-Box Contraint-Programming Solvers | cs.AI | Robust search procedures are a central component in the design of black-box
constraint-programming solvers. This paper proposes activity-based search, the
idea of using the activity of variables during propagation to guide the search.
Activity-based search was compared experimentally to impact-based search and
the WDEG... | computer science |
35,681 | Markov Localization for Mobile Robots in Dynamic Environments | cs.AI | Localization, that is the estimation of a robot's location from sensor data,
is a fundamental problem in mobile robotics. This papers presents a version of
Markov localization which provides accurate position estimates and which is
tailored towards dynamic environments. The key idea of Markov localization is
to maintai... | computer science |
35,682 | Decentralized Markets versus Central Control: A Comparative Study | cs.MA | Multi-Agent Systems (MAS) promise to offer solutions to problems where
established, older paradigms fall short. In order to validate such claims that
are repeatedly made in software agent publications, empirical in-depth studies
of advantages and weaknesses of multi-agent solutions versus conventional ones
in practical... | computer science |
35,683 | Robust Agent Teams via Socially-Attentive Monitoring | cs.MA | Agents in dynamic multi-agent environments must monitor their peers to
execute individual and group plans. A key open question is how much monitoring
of other agents' states is required to be effective: The Monitoring Selectivity
Problem. We investigate this question in the context of detecting failures in
teams of coo... | computer science |
35,684 | The Impact of Mutation Rate on the Computation Time of Evolutionary
Dynamic Optimization | cs.AI | Mutation has traditionally been regarded as an important operator in
evolutionary algorithms. In particular, there have been many experimental
studies which showed the effectiveness of adapting mutation rates for various
static optimization problems. Given the perceived effectiveness of adaptive and
self-adaptive mutat... | computer science |
35,685 | Learning Geometrically-Constrained Hidden Markov Models for Robot
Navigation: Bridging the Topological-Geometrical Gap | cs.AI | Hidden Markov models (HMMs) and partially observable Markov decision
processes (POMDPs) provide useful tools for modeling dynamical systems. They
are particularly useful for representing the topology of environments such as
road networks and office buildings, which are typical for robot navigation and
planning. The wor... | computer science |
35,686 | Predicting growth fluctuation in network economy | cs.AI | This study presents a method to predict the growth fluctuation of firms
interdependent in a network economy. The risk of downward growth fluctuation of
firms is calculated from the statistics on Japanese industry. | computer science |
35,687 | Interdefinability of defeasible logic and logic programming under the
well-founded semantics | cs.AI | We provide a method of translating theories of Nute's defeasible logic into
logic programs, and a corresponding translation in the opposite direction.
Under certain natural restrictions, the conclusions of defeasible theories
under the ambiguity propagating defeasible logic ADL correspond to those of the
well-founded s... | computer science |
35,688 | On the expressive power of unit resolution | cs.AI | This preliminary report addresses the expressive power of unit resolution
regarding input data encoded with partial truth assignments of propositional
variables. A characterization of the functions that are computable in this way,
which we propose to call propagatable functions, is given. By establishing that
propagata... | computer science |
35,689 | How Insight Emerges in a Distributed, Content-addressable Memory | cs.AI | We begin this chapter with the bold claim that it provides a neuroscientific
explanation of the magic of creativity. Creativity presents a formidable
challenge for neuroscience. Neuroscience generally involves studying what
happens in the brain when someone engages in a task that involves responding to
a stimulus, or r... | computer science |
35,690 | Intelligent Self-Repairable Web Wrappers | cs.AI | The amount of information available on the Web grows at an incredible high
rate. Systems and procedures devised to extract these data from Web sources
already exist, and different approaches and techniques have been investigated
during the last years. On the one hand, reliable solutions should provide
robust algorithms... | computer science |
35,691 | Symmetry-Based Search Space Reduction For Grid Maps | cs.AI | In this paper we explore a symmetry-based search space reduction technique
which can speed up optimal pathfinding on undirected uniform-cost grid maps by
up to 38 times. Our technique decomposes grid maps into a set of empty
rectangles, removing from each rectangle all interior nodes and possibly some
from along the pe... | computer science |
35,692 | Competitive Safety Analysis: Robust Decision-Making in Multi-Agent
Systems | cs.GT | Much work in AI deals with the selection of proper actions in a given (known
or unknown) environment. However, the way to select a proper action when facing
other agents is quite unclear. Most work in AI adopts classical game-theoretic
equilibrium analysis to predict agent behavior in such settings. This approach
howev... | computer science |
35,693 | Interactive Execution Monitoring of Agent Teams | cs.MA | There is an increasing need for automated support for humans monitoring the
activity of distributed teams of cooperating agents, both human and machine. We
characterize the domain-independent challenges posed by this problem, and
describe how properties of domains influence the challenges and their
solutions. We will c... | computer science |
35,694 | Belief-propagation algorithm and the Ising model on networks with
arbitrary distributions of motifs | cs.AI | We generalize the belief-propagation algorithm to sparse random networks with
arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in
these networks belongs to a given set of motifs (generalization of the
configuration model). These networks can be treated as sparse uncorrelated
hypergraphs in which ... | computer science |
35,695 | Class-based Rough Approximation with Dominance Principle | cs.CC | Dominance-based Rough Set Approach (DRSA), as the extension of Pawlak's Rough
Set theory, is effective and fundamentally important in Multiple Criteria
Decision Analysis (MCDA). In previous DRSA models, the definitions of the upper
and lower approximations are preserving the class unions rather than the
singleton class... | computer science |
35,696 | Scaling Inference for Markov Logic with a Task-Decomposition Approach | cs.AI | Motivated by applications in large-scale knowledge base construction, we
study the problem of scaling up a sophisticated statistical inference framework
called Markov Logic Networks (MLNs). Our approach, Felix, uses the idea of
Lagrangian relaxation from mathematical programming to decompose a program into
smaller task... | computer science |
35,697 | Exploiting Agent and Type Independence in Collaborative Graphical
Bayesian Games | cs.AI | Efficient collaborative decision making is an important challenge for
multiagent systems. Finding optimal joint actions is especially challenging
when each agent has only imperfect information about the state of its
environment. Such problems can be modeled as collaborative Bayesian games in
which each agent receives p... | computer science |
35,698 | A Data Mining Approach to the Diagnosis of Tuberculosis by Cascading
Clustering and Classification | cs.AI | In this paper, a methodology for the automated detection and classification
of Tuberculosis(TB) is presented. Tuberculosis is a disease caused by
mycobacterium which spreads through the air and attacks low immune bodies
easily. Our methodology is based on clustering and classification that
classifies TB into two catego... | computer science |
35,699 | A Knowledge Mining Model for Ranking Institutions using Rough Computing
with Ordering Rules and Formal Concept analysis | cs.AI | Emergences of computers and information technological revolution made
tremendous changes in the real world and provides a different dimension for the
intelligent data analysis. Well formed fact, the information at right time and
at right place deploy a better knowledge.However, the challenge arises when
larger volume o... | computer science |
35,700 | The Ditmarsch Tale of Wonders - The Dynamics of Lying | cs.AI | We propose a dynamic logic of lying, wherein a 'lie that phi' (where phi is a
formula in the logic) is an action in the sense of dynamic modal logic, that is
interpreted as a state transformer relative to the formula phi. The states that
are being transformed are pointed Kripke models encoding the uncertainty of
agents... | computer science |
35,701 | Feature Reinforcement Learning In Practice | cs.AI | Following a recent surge in using history-based methods for resolving
perceptual aliasing in reinforcement learning, we introduce an algorithm based
on the feature reinforcement learning framework called PhiMDP. To create a
practical algorithm we devise a stochastic search procedure for a class of
context trees based o... | computer science |
35,702 | A Dynamical Systems Approach for Static Evaluation in Go | cs.AI | In the paper arguments are given why the concept of static evaluation has the
potential to be a useful extension to Monte Carlo tree search. A new concept of
modeling static evaluation through a dynamical system is introduced and
strengths and weaknesses are discussed. The general suitability of this
approach is demons... | computer science |
35,703 | Computing with Logic as Operator Elimination: The ToyElim System | cs.AI | A prototype system is described whose core functionality is, based on
propositional logic, the elimination of second-order operators, such as Boolean
quantifiers and operators for projection, forgetting and circumscription. This
approach allows to express many representational and computational tasks in
knowledge repre... | computer science |
35,704 | A prototype of a knowledge-based programming environment | cs.AI | In this paper we present a proposal for a knowledge-based programming
environment. In such an environment, declarative background knowledge,
procedures, and concrete data are represented in suitable languages and
combined in a flexible manner. This leads to a highly declarative programming
style. We illustrate our appr... | computer science |
35,705 | Translating Answer-Set Programs into Bit-Vector Logic | cs.AI | Answer set programming (ASP) is a paradigm for declarative problem solving
where problems are first formalized as rule sets, i.e., answer-set programs, in
a uniform way and then solved by computing answer sets for programs. The
satisfiability modulo theories (SMT) framework follows a similar modelling
philosophy but th... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.