Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,405 | Societal Implicit Memory and his Speed on Tracking Extrema over Dynamic
Environments using Self-Regulatory Swarms | cs.MA | In order to overcome difficult dynamic optimization and environment extrema
tracking problems, We propose a Self-Regulated Swarm (SRS) algorithm which
hybridizes the advantageous characteristics of Swarm Intelligence as the
emergence of a societal environmental memory or cognitive map via collective
pheromone laying in... | computer science |
35,406 | Self-Regulated Artificial Ant Colonies on Digital Image Habitats | cs.MA | Artificial life models, swarm intelligent and evolutionary computation
algorithms are usually built on fixed size populations. Some studies indicate
however that varying the population size can increase the adaptability of these
systems and their capability to react to changing environments. In this paper
we present an... | computer science |
35,407 | A geometry of information, I: Nerves, posets and differential forms | cs.AI | The main theme of this workshop (Dagstuhl seminar 04351) is `Spatial
Representation: Continuous vs. Discrete'. Spatial representation has two
contrasting but interacting aspects (i) representation of spaces' and (ii)
representation by spaces. In this paper, we will examine two aspects that are
common to both interpreta... | computer science |
35,408 | Integration of navigation and action selection functionalities in a
computational model of cortico-basal ganglia-thalamo-cortical loops | cs.AI | This article describes a biomimetic control architecture affording an animat
both action selection and navigation functionalities. It satisfies the survival
constraint of an artificial metabolism and supports several complementary
navigation strategies. It builds upon an action selection model based on the
basal gangli... | computer science |
35,409 | Efficient Open World Reasoning for Planning | cs.AI | We consider the problem of reasoning and planning with incomplete knowledge
and deterministic actions. We introduce a knowledge representation scheme
called PSIPLAN that can effectively represent incompleteness of an agent's
knowledge while allowing for sound, complete and tractable entailment in
domains where the set ... | computer science |
35,410 | LPAR-05 Workshop: Empirically Successfull Automated Reasoning in
Higher-Order Logic (ESHOL) | cs.AI | This workshop brings together practioners and researchers who are involved in
the everyday aspects of logical systems based on higher-order logic. We hope to
create a friendly and highly interactive setting for discussions around the
following four topics. Implementation and development of proof assistants based
on any... | computer science |
35,411 | Combining Relational Algebra, SQL, Constraint Modelling, and Local
Search | cs.AI | The goal of this paper is to provide a strong integration between constraint
modelling and relational DBMSs. To this end we propose extensions of standard
query languages such as relational algebra and SQL, by adding constraint
modelling capabilities to them. In particular, we propose non-deterministic
extensions of bo... | computer science |
35,412 | Using Domain Knowledge in Evolutionary System Identification | cs.AI | Two example of Evolutionary System Identification are presented to highlight
the importance of incorporating Domain Knowledge: the discovery of an
analytical indentation law in Structural Mechanics using constrained Genetic
Programming, and the identification of the repartition of underground
velocities in Seismic Pros... | computer science |
35,413 | Explaining Constraint Programming | cs.PL | We discuss here constraint programming (CP) by using a proof-theoretic
perspective. To this end we identify three levels of abstraction. Each level
sheds light on the essence of CP.
In particular, the highest level allows us to bring CP closer to the
computation as deduction paradigm. At the middle level we can expla... | computer science |
35,414 | Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs | cs.DM | For graphs $G$ and $H$, a mapping $f: V(G)\dom V(H)$ is a homomorphism of $G$
to $H$ if $uv\in E(G)$ implies $f(u)f(v)\in E(H).$ If, moreover, each vertex $u
\in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of the
homomorphism $f$ is $\sum_{u\in V(G)}c_{f(u)}(u)$. For each fixed graph $H$, we
have... | computer science |
35,415 | Yet Another Efficient Unification Algorithm | cs.LO | The unification algorithm is at the core of the logic programming paradigm,
the first unification algorithm being developed by Robinson [5]. More efficient
algorithms were developed later [3] and I introduce here yet another efficient
unification algorithm centered on a specific data structure, called the
Unification T... | computer science |
35,416 | UniCalc.LIN: a linear constraint solver for the UniCalc system | cs.MS | In this short paper we present a linear constraint solver for the UniCalc
system, an environment for reliable solution of mathematical modeling problems. | computer science |
35,417 | New results on rewrite-based satisfiability procedures | cs.AI | Program analysis and verification require decision procedures to reason on
theories of data structures. Many problems can be reduced to the satisfiability
of sets of ground literals in theory T. If a sound and complete inference
system for first-order logic is guaranteed to terminate on T-satisfiability
problems, any t... | computer science |
35,418 | Quantum Fuzzy Sets: Blending Fuzzy Set Theory and Quantum Computation | cs.LO | In this article we investigate a way in which quantum computing can be used
to extend the class of fuzzy sets. The core idea is to see states of a quantum
register as characteristic functions of quantum fuzzy subsets of a given set.
As the real unit interval is embedded in the Bloch sphere, every fuzzy set is
automatic... | computer science |
35,419 | An Unfolding-Based Semantics for Logic Programming with Aggregates | cs.SE | The paper presents two equivalent definitions of answer sets for logic
programs with aggregates. These definitions build on the notion of unfolding of
aggregates, and they are aimed at creating methodologies to translate logic
programs with aggregates to normal logic programs or positive programs, whose
answer set sema... | computer science |
35,420 | Ontological Representations of Software Patterns | cs.SE | This paper is based on and advocates the trend in software engineering of
extending the use of software patterns as means of structuring solutions to
software development problems (be they motivated by best practice or by company
interests and policies). The paper argues that, on the one hand, this
development requires... | computer science |
35,421 | Supervisory Control of Fuzzy Discrete Event Systems: A Formal Approach | cs.LO | Fuzzy {\it discrete event systems} (DESs) were proposed recently by Lin and
Ying [19], which may better cope with the real-world problems with fuzziness,
impreciseness, and subjectivity such as those in biomedicine. As a continuation
of [19], in this paper we further develop fuzzy DESs by dealing with
supervisory contr... | computer science |
35,422 | The meaning of manufacturing know-how | cs.AI | This paper investigates the phenomenon of manufacturing know-how. First, the
abstract notion of knowledge is discussed, and a terminological basis is
introduced to treat know-how as a kind of knowledge. Next, a brief survey of
the recently reported works dealt with manufacturing know-how is presented, and
an explicit d... | computer science |
35,423 | A Decision-Making Support System Based on Know-How | cs.CE | The research results described are concerned with: - developing a domain
modeling method and tools to provide the design and implementation of
decision-making support systems for computer integrated manufacturing; -
building a decision-making support system based on know-how and its software
environment. The research i... | computer science |
35,424 | A simulation engine to support production scheduling using
genetics-based machine learning | cs.CE | The ever higher complexity of manufacturing systems, continually shortening
life cycles of products and their increasing variety, as well as the unstable
market situation of the recent years require introducing grater flexibility and
responsiveness to manufacturing processes. From this perspective, one of the
critical ... | computer science |
35,425 | Consecutive Support: Better Be Close! | cs.AI | We propose a new measure of support (the number of occur- rences of a
pattern), in which instances are more important if they occur with a certain
frequency and close after each other in the stream of trans- actions. We will
explain this new consecutive support and discuss how patterns can be found
faster by pruning th... | computer science |
35,426 | Evolutionary Design: Philosophy, Theory, and Application Tactics | cs.CE | Although it has contributed to remarkable improvements in some specific
areas, attempts to develop a universal design theory are generally
characterized by failure. This paper sketches arguments for a new approach to
engineering design based on Semiotics - the science about signs. The approach
is to combine different d... | computer science |
35,427 | Is there an Elegant Universal Theory of Prediction? | cs.AI | Solomonoff's inductive learning model is a powerful, universal and highly
elegant theory of sequence prediction. Its critical flaw is that it is
incomputable and thus cannot be used in practice. It is sometimes suggested
that it may still be useful to help guide the development of very general and
powerful theories of ... | computer science |
35,428 | The Completeness of Propositional Resolution: A Simple and
Constructive<br> Proof | cs.LO | It is well known that the resolution method (for propositional logic) is
complete. However, completeness proofs found in the literature use an argument
by contradiction showing that if a set of clauses is unsatisfiable, then it
must have a resolution refutation. As a consequence, none of these proofs
actually gives an ... | computer science |
35,429 | Evaluating Variable Length Markov Chain Models for Analysis of User Web
Navigation Sessions | cs.AI | Markov models have been widely used to represent and analyse user web
navigation data. In previous work we have proposed a method to dynamically
extend the order of a Markov chain model and a complimentary method for
assessing the predictive power of such a variable length Markov chain. Herein,
we review these two meth... | computer science |
35,430 | Database Querying under Changing Preferences | cs.DB | We present here a formal foundation for an iterative and incremental approach
to constructing and evaluating preference queries. Our main focus is on query
modification: a query transformation approach which works by revising the
preference relation in the query. We provide a detailed analysis of the cases
where the or... | computer science |
35,431 | An Analysis of Arithmetic Constraints on Integer Intervals | cs.AI | Arithmetic constraints on integer intervals are supported in many constraint
programming systems. We study here a number of approaches to implement
constraint propagation for these constraints. To describe them we introduce
integer interval arithmetic. Each approach is explained using appropriate proof
rules that reduc... | computer science |
35,432 | The Minimal Cost Algorithm for Off-Line Diagnosability of Discrete Event
Systems | cs.AI | The failure diagnosis for {\it discrete event systems} (DESs) has been given
considerable attention in recent years. Both on-line and off-line diagnostics
in the framework of DESs was first considered by Lin Feng in 1994, and
particularly an algorithm for diagnosability of DESs was presented. Motivated
by some existing... | computer science |
35,433 | Reasoning with Intervals on Granules | cs.AI | The formalizations of periods of time inside a linear model of Time are
usually based on the notion of intervals, that may contain or may not their
endpoints. This is not enought when the periods are written in terms of coarse
granularities with respect to the event taken into account. For instance, how
to express the ... | computer science |
35,434 | Decomposable Theories | cs.LO | We present in this paper a general algorithm for solving first-order formulas
in particular theories called "decomposable theories". First of all, using
special quantifiers, we give a formal characterization of decomposable theories
and show some of their properties. Then, we present a general algorithm for
solving fir... | computer science |
35,435 | Towards "Propagation = Logic + Control" | cs.PL | Constraint propagation algorithms implement logical inference. For
efficiency, it is essential to control whether and in what order basic
inference steps are taken. We provide a high-level framework that clearly
differentiates between information needed for controlling propagation versus
that needed for the logical sem... | computer science |
35,436 | Infinite Qualitative Simulations by Means of Constraint Programming | cs.AI | We introduce a constraint-based framework for studying infinite qualitative
simulations concerned with contingencies such as time, space, shape, size,
abstracted into a finite set of qualitative relations. To define the
simulations, we combine constraints that formalize the background knowledge
concerned with qualitati... | computer science |
35,437 | Cascade hash tables: a series of multilevel double hashing schemes with
O(1) worst case lookup time | cs.DS | In this paper, the author proposes a series of multilevel double hashing
schemes called cascade hash tables. They use several levels of hash tables. In
each table, we use the common double hashing scheme. Higher level hash tables
work as fail-safes of lower level hash tables. By this strategy, it could
effectively redu... | computer science |
35,438 | Automated verification of weak equivalence within the SMODELS system | cs.AI | In answer set programming (ASP), a problem at hand is solved by (i) writing a
logic program whose answer sets correspond to the solutions of the problem, and
by (ii) computing the answer sets of the program using an answer set solver as
a search engine. Typically, a programmer creates a series of gradually
improving lo... | computer science |
35,439 | Logic programs with monotone abstract constraint atoms | cs.AI | We introduce and study logic programs whose clauses are built out of monotone
constraint atoms. We show that the operational concept of the one-step
provability operator generalizes to programs with monotone constraint atoms,
but the generalization involves nondeterminism. Our main results demonstrate
that our formalis... | computer science |
35,440 | Undecidability of the unification and admissibility problems for modal
and description logics | cs.LO | We show that the unification problem `is there a substitution instance of a
given formula that is provable in a given logic?' is undecidable for basic
modal logics K and K4 extended with the universal modality. It follows that the
admissibility problem for inference rules is undecidable for these logics as
well. These ... | computer science |
35,441 | Matrix Games, Linear Programming, and Linear Approximation | cs.GT | The following four classes of computational problems are equivalent: solving
matrix games, solving linear programs, best $l^{\infty}$ linear approximation,
best $l^1$ linear approximation. | computer science |
35,442 | Verification, Validation and Integrity of Distributed and Interchanged
Rule Based Policies and Contracts in the Semantic Web | cs.AI | Rule-based policy and contract systems have rarely been studied in terms of
their software engineering properties. This is a serious omission, because in
rule-based policy or contract representation languages rules are being used as
a declarative programming language to formalize real-world decision logic and
create IS... | computer science |
35,443 | An application-oriented terminology evaluation: the case of back-of-the
book indexes | cs.AI | This paper addresses the problem of computational terminology evaluation not
per se but in a specific application context. This paper describes the
evaluation procedure that has been used to assess the validity of our overall
indexing approach and the quality of the IndDoc indexing tool. Even if
user-oriented extended ... | computer science |
35,444 | Using NLP to build the hypertextuel network of a back-of-the-book index | cs.AI | Relying on the idea that back-of-the-book indexes are traditional devices for
navigation through large documents, we have developed a method to build a
hypertextual network that helps the navigation in a document. Building such an
hypertextual network requires selecting a list of descriptors, identifying the
relevant t... | computer science |
35,445 | Event-based Information Extraction for the biomedical domain: the
Caderige project | cs.AI | This paper gives an overview of the Caderige project. This project involves
teams from different areas (biology, machine learning, natural language
processing) in order to develop high-level analysis tools for extracting
structured information from biological bibliographical databases, especially
Medline. The paper giv... | computer science |
35,446 | Ontologies and Information Extraction | cs.AI | This report argues that, even in the simplest cases, IE is an ontology-driven
process. It is not a mere text filtering method based on simple pattern
matching and keywords, because the extracted pieces of texts are interpreted
with respect to a predefined partial domain model. This report shows that
depending on the na... | computer science |
35,447 | Efficient constraint propagation engines | cs.AI | This paper presents a model and implementation techniques for speeding up
constraint propagation. Three fundamental approaches to improving constraint
propagation based on propagators as implementations of constraints are
explored: keeping track of which propagators are at fixpoint, choosing which
propagator to apply n... | computer science |
35,448 | A Logical Approach to Efficient Max-SAT solving | cs.AI | Weighted Max-SAT is the optimization version of SAT and many important
problems can be naturally encoded as such. Solving weighted Max-SAT is an
important problem from both a theoretical and a practical point of view. In
recent years, there has been considerable interest in finding efficient solving
techniques. Most of... | computer science |
35,449 | Analytic Tableaux Calculi for KLM Logics of Nonmonotonic Reasoning | cs.LO | We present tableau calculi for some logics of nonmonotonic reasoning, as
defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for
all KLM logics, namely preferential, loop-cumulative, cumulative and rational
logics. Our calculi are obtained by introducing suitable modalities to
interpret conditional... | computer science |
35,450 | A Backtracking-Based Algorithm for Computing Hypertree-Decompositions | cs.DS | Hypertree decompositions of hypergraphs are a generalization of tree
decompositions of graphs. The corresponding hypertree-width is a measure for
the cyclicity and therefore tractability of the encoded computation problem.
Many NP-hard decision and computation problems are known to be tractable on
instances whose struc... | computer science |
35,451 | Propositional theories are strongly equivalent to logic programs | cs.AI | This paper presents a property of propositional theories under the answer
sets semantics (called Equilibrium Logic for this general syntax): any theory
can always be reexpressed as a strongly equivalent disjunctive logic program,
possibly with negation in the head. We provide two different proofs for this
result: one i... | computer science |
35,452 | Time and the Prisoner's Dilemma | cs.GT | This paper examines the integration of computational complexity into game
theoretic models. The example focused on is the Prisoner's Dilemma, repeated
for a finite length of time. We show that a minimal bound on the players'
computational ability is sufficient to enable cooperative behavior.
In addition, a variant of... | computer science |
35,453 | Dealing With Logical Omniscience: Expressiveness and Pragmatics | cs.LO | We examine four approaches for dealing with the logical omniscience problem
and their potential applicability: the syntactic approach, awareness,
algorithmic knowledge, and impossible possible worlds. Although in some
settings these approaches are equi-expressive and can capture all epistemic
states, in other settings ... | computer science |
35,454 | Logic Programming with Satisfiability | cs.PL | This paper presents a Prolog interface to the MiniSat satisfiability solver.
Logic program- ming with satisfiability combines the strengths of the two
paradigms: logic programming for encoding search problems into satisfiability
on the one hand and efficient SAT solving on the other. This synergy between
these two expo... | computer science |
35,455 | Multimodal Meaning Representation for Generic Dialogue Systems
Architectures | cs.AI | An unified language for the communicative acts between agents is essential
for the design of multi-agents architectures. Whatever the type of interaction
(linguistic, multimodal, including particular aspects such as force feedback),
whatever the type of application (command dialogue, request dialogue, database
querying... | computer science |
35,456 | Copula Component Analysis | cs.IR | A framework named Copula Component Analysis (CCA) for blind source separation
is proposed as a generalization of Independent Component Analysis (ICA). It
differs from ICA which assumes independence of sources that the underlying
components may be dependent with certain structure which is represented by
Copula. By incor... | computer science |
35,457 | Mathematical model of interest matchmaking in electronic social networks | cs.CY | The problem of matchmaking in electronic social networks is formulated as an
optimization problem. In particular, a function measuring the matching degree
of fields of interest of a search profile with those of an advertising profile
is proposed. | computer science |
35,458 | Intensional Models for the Theory of Types | math.LO | In this paper we define intensional models for the classical theory of types,
thus arriving at an intensional type logic ITL. Intensional models generalize
Henkin's general models and have a natural definition. As a class they do not
validate the axiom of Extensionality. We give a cut-free sequent calculus for
type the... | computer science |
35,459 | Remarks on Inheritance Systems | math.LO | We try a conceptual analysis of inheritance diagrams, first in abstract
terms, and then compare to "normality" and the "small/big sets" of preferential
and related reasoning. The main ideas are about nodes as truth values and
information sources, truth comparison by paths, accessibility or relevance of
information by p... | computer science |
35,460 | Determining possible avenues of approach using ANTS | nlin.AO | Threat assessment is an important part of level 3 data fusion. Here we study
a subproblem of this, worst-case risk assessment. Inspired by agent-based
models used for simulation of trail formation for urban planning, we use ant
colony optimization (ANTS) to determine possible avenues of approach for the
enemy, given a ... | computer science |
35,461 | Protocol Requirements for Self-organizing Artifacts: Towards an Ambient
Intelligence | nlin.AO | We discuss which properties common-use artifacts should have to collaborate
without human intervention. We conceive how devices, such as mobile phones,
PDAs, and home appliances, could be seamlessly integrated to provide an
"ambient intelligence" that responds to the user's desires without requiring
explicit programmin... | computer science |
35,462 | Improving ecological niche models by data mining large environmental
datasets for surrogate models | cs.AI | WhyWhere is a new ecological niche modeling (ENM) algorithm for mapping and
explaining the distribution of species. The algorithm uses image processing
methods to efficiently sift through large amounts of data to find the few
variables that best predict species occurrence. The purpose of this paper is to
describe and j... | computer science |
35,463 | Algebras of Measurements: the logical structure of Quantum Mechanics | cs.AI | In Quantum Physics, a measurement is represented by a projection on some
closed subspace of a Hilbert space. We study algebras of operators that
abstract from the algebra of projections on closed subspaces of a Hilbert
space. The properties of such operators are justified on epistemological
grounds. Commutation of meas... | computer science |
35,464 | `Plausibilities of plausibilities': an approach through circumstances | cs.AI | Probability-like parameters appearing in some statistical models, and their
prior distributions, are reinterpreted through the notion of `circumstance', a
term which stands for any piece of knowledge that is useful in assigning a
probability and that satisfies some additional logical properties. The idea,
which can be ... | computer science |
35,465 | Markovian Entanglement Networks | cs.AI | Graphical models of probabilistic dependencies have been extensively
investigated in the context of classical uncertainty. However, in some domains
(most notably, in computational physics and quantum computing) the nature of
the relevant uncertainty is non-classical, and the laws of classical
probability theory are sup... | computer science |
35,466 | Can the Internet cope with stress? | cs.HC | When will the Internet become aware of itself? In this note the problem is
approached by asking an alternative question: Can the Internet cope with
stress? By extrapolating the psychological difference between coping and
defense mechanisms a distributed software experiment is outlined which could
reject the hypothesis ... | computer science |
35,467 | Clustering Co-occurrence of Maximal Frequent Patterns in Streams | cs.AI | One way of getting a better view of data is using frequent patterns. In this
paper frequent patterns are subsets that occur a minimal number of times in a
stream of itemsets. However, the discovery of frequent patterns in streams has
always been problematic. Because streams are potentially endless it is in
principle im... | computer science |
35,468 | Clustering with Lattices in the Analysis of Graph Patterns | cs.AI | Mining frequent subgraphs is an area of research where we have a given set of
graphs (each graph can be seen as a transaction), and we search for (connected)
subgraphs contained in many of these graphs. In this work we will discuss
techniques used in our framework Lattice2SAR for mining and analysing frequent
subgraph ... | computer science |
35,469 | Mining Patterns with a Balanced Interval | cs.AI | In many applications it will be useful to know those patterns that occur with
a balanced interval, e.g., a certain combination of phone numbers are called
almost every Friday or a group of products are sold a lot on Tuesday and
Thursday.
In previous work we proposed a new measure of support (the number of
occurrences... | computer science |
35,470 | A first-order Temporal Logic for Actions | cs.AI | We present a multi-modal action logic with first-order modalities, which
contain terms which can be unified with the terms inside the subsequent
formulas and which can be quantified. This makes it possible to handle
simultaneously time and states. We discuss applications of this language to
action theory where it is po... | computer science |
35,471 | Generalizing Consistency and other Constraint Properties to Quantified
Constraints | cs.LO | Quantified constraints and Quantified Boolean Formulae are typically much
more difficult to reason with than classical constraints, because quantifier
alternation makes the usual notion of solution inappropriate. As a consequence,
basic properties of Constraint Satisfaction Problems (CSP), such as consistency
or substi... | computer science |
35,472 | Modeling Computations in a Semantic Network | cs.AI | Semantic network research has seen a resurgence from its early history in the
cognitive sciences with the inception of the Semantic Web initiative. The
Semantic Web effort has brought forth an array of technologies that support the
encoding, storage, and querying of the semantic network data structure at the
world stag... | computer science |
35,473 | Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets | cs.GT | We provide here an epistemic analysis of arbitrary strategic games based on
the possibility correspondences. Such an analysis calls for the use of
transfinite iterations of the corresponding operators. Our approach is based on
Tarski's Fixpoint Theorem and applies both to the notions of rationalizability
and the iterat... | computer science |
35,474 | Theory of Finite or Infinite Trees Revisited | cs.LO | We present in this paper a first-order axiomatization of an extended theory
$T$ of finite or infinite trees, built on a signature containing an infinite
set of function symbols and a relation $\fini(t)$ which enables to distinguish
between finite or infinite trees. We show that $T$ has at least one model and
prove its ... | computer science |
35,475 | Neutrality and Many-Valued Logics | cs.LO | In this book, we consider various many-valued logics: standard, linear,
hyperbolic, parabolic, non-Archimedean, p-adic, interval, neutrosophic, etc. We
survey also results which show the tree different proof-theoretic frameworks
for many-valued logics, e.g. frameworks of the following deductive calculi:
Hilbert's style... | computer science |
35,476 | Bijective Faithful Translations among Default Logics | cs.AI | In this article, we study translations between variants of defaults logics
such that the extensions of the theories that are the input and the output of
the translation are in a bijective correspondence. We assume that a translation
can introduce new variables and that the result of translating a theory can
either be p... | computer science |
35,477 | A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts
and their Usage | cs.DL | The large-scale analysis of scholarly artifact usage is constrained primarily
by current practices in usage data archiving, privacy issues concerned with the
dissemination of usage data, and the lack of a practical ontology for modeling
the usage domain. As a remedy to the third constraint, this article presents a
scho... | computer science |
35,478 | A Data-Parallel Version of Aleph | cs.AI | This is to present work on modifying the Aleph ILP system so that it
evaluates the hypothesised clauses in parallel by distributing the data-set
among the nodes of a parallel or distributed machine. The paper briefly
discusses MPI, the interface used to access message- passing libraries for
parallel computers and clust... | computer science |
35,479 | Effective Generation of Subjectively Random Binary Sequences | cs.HC | We present an algorithm for effectively generating binary sequences which
would be rated by people as highly likely to have been generated by a random
process, such as flipping a fair coin. | computer science |
35,480 | Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective
Attention, Curiosity & Creativity | cs.AI | I postulate that human or other intelligent agents function or should
function as follows. They store all sensory observations as they come - the
data is holy. At any time, given some agent's current coding capabilities, part
of the data is compressible by a short and hopefully fast program / description
/ explanation ... | computer science |
35,481 | Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise
Vehicle Localization and Road Matching | cs.AI | This paper presents a multi-sensor fusion strategy for a novel road-matching
method designed to support real-time navigational features within advanced
driving-assistance systems. Managing multihypotheses is a useful strategy for
the road-matching problem. The multi-sensor fusion and multi-modal estimation
are realized... | computer science |
35,482 | Efficient Tabling Mechanisms for Transaction Logic Programs | cs.LO | In this paper we present efficient evaluation algorithms for the Horn
Transaction Logic (a generalization of the regular Horn logic programs with
state updates). We present two complementary methods for optimizing the
implementation of Transaction Logic. The first method is based on tabling and
we modified the proof th... | computer science |
35,483 | Autoencoder, Principal Component Analysis and Support Vector Regression
for Data Imputation | cs.AI | Data collection often results in records that have missing values or
variables. This investigation compares 3 different data imputation models and
identifies their merits by using accuracy measures. Autoencoder Neural
Networks, Principal components and Support Vector regression are used for
prediction and combined with... | computer science |
35,484 | Mining for trees in a graph is NP-complete | cs.DB | Mining for trees in a graph is shown to be NP-complete. | computer science |
35,485 | A Common View on Strong, Uniform, and Other Notions of Equivalence in
Answer-Set Programming | cs.AI | Logic programming under the answer-set semantics nowadays deals with numerous
different notions of program equivalence. This is due to the fact that
equivalence for substitution (known as strong equivalence) and ordinary
equivalence are different concepts. The former holds, given programs P and Q,
iff P can be faithful... | computer science |
35,486 | On Using Unsatisfiability for Solving Maximum Satisfiability | cs.AI | Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with
several practical applications. The most widely known MAXS AT algorithms are
ineffective at solving hard problems instances from practical application
domains. Recent work proposed using efficient Boolean Satisfiability (SAT)
solvers for solvi... | computer science |
35,487 | Cumulative and Averaging Fission of Beliefs | cs.AI | Belief fusion is the principle of combining separate beliefs or bodies of
evidence originating from different sources. Depending on the situation to be
modelled, different belief fusion methods can be applied. Cumulative and
averaging belief fusion is defined for fusing opinions in subjective logic, and
for fusing beli... | computer science |
35,488 | About Algorithm for Transformation of Logic Functions (ATLF) | cs.LO | In this article the algorithm for transformation of logic functions which are
given by truth tables is considered. The suggested algorithm allows the
transformation of many-valued logic functions with the required number of
variables and can be looked in this sense as universal. | computer science |
35,489 | Numerical Sensitivity and Efficiency in the Treatment of Epistemic and
Aleatory Uncertainty | cs.AI | The treatment of both aleatory and epistemic uncertainty by recent methods
often requires an high computational effort. In this abstract, we propose a
numerical sampling method allowing to lighten the computational burden of
treating the information by means of so-called fuzzy random variables. | computer science |
35,490 | Common knowledge logic in a higher order proof assistant? | cs.AI | This paper presents experiments on common knowledge logic, conducted with the
help of the proof assistant Coq. The main feature of common knowledge logic is
the eponymous modality that says that a group of agents shares a knowledge
about a certain proposition in a inductive way. This modality is specified by
using a fi... | computer science |
35,491 | Does intelligence imply contradiction? | cs.AI | Contradiction is often seen as a defect of intelligent systems and a
dangerous limitation on efficiency. In this paper we raise the question of
whether, on the contrary, it could be considered a key tool in increasing
intelligence in biological structures. A possible way of answering this
question in a mathematical con... | computer science |
35,492 | Les Agents comme des interpréteurs Scheme : Spécification dynamique
par la communication | cs.MA | We proposed in previous papers an extension and an implementation of the
STROBE model, which regards the Agents as Scheme interpreters. These Agents are
able to interpret messages in a dedicated environment including an interpreter
that learns from the current conversation therefore representing evolving
meta-level Age... | computer science |
35,493 | New Implementation Framework for Saturation-Based Reasoning | cs.AI | The saturation-based reasoning methods are among the most theoretically
developed ones and are used by most of the state-of-the-art first-order logic
reasoners. In the last decade there was a sharp increase in performance of such
systems, which I attribute to the use of advanced calculi and the intensified
research in ... | computer science |
35,494 | Design and Implementation of Aggregate Functions in the DLV System | cs.AI | Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows
for expressing every property of finite structures that is decidable in the
complexity class SigmaP2 (= NP^NP). Despite this high expressiveness, there are
some simple properties, often arising in real-world applications, which cannot
be enco... | computer science |
35,495 | Use of Rapid Probabilistic Argumentation for Ranking on Large Complex
Networks | cs.AI | We introduce a family of novel ranking algorithms called ERank which run in
linear/near linear time and build on explicitly modeling a network as uncertain
evidence. The model uses Probabilistic Argumentation Systems (PAS) which are a
combination of probability theory and propositional logic, and also a special
case of... | computer science |
35,496 | Binary Decision Diagrams for Affine Approximation | cs.LO | Selman and Kautz's work on ``knowledge compilation'' established how
approximation (strengthening and/or weakening) of a propositional
knowledge-base can be used to speed up query processing, at the expense of
completeness. In this classical approach, querying uses Horn over- and
under-approximations of a given knowled... | computer science |
35,497 | Symmetry Breaking for Maximum Satisfiability | cs.AI | Symmetries are intrinsic to many combinatorial problems including Boolean
Satisfiability (SAT) and Constraint Programming (CP). In SAT, the
identification of symmetry breaking predicates (SBPs) is a well-known, often
effective, technique for solving hard problems. The identification of SBPs in
SAT has been the subject ... | computer science |
35,498 | The Choquet integral for the aggregation of interval scales in
multicriteria decision making | cs.DM | This paper addresses the question of which models fit with information
concerning the preferences of the decision maker over each attribute, and his
preferences about aggregation of criteria (interacting criteria). We show that
the conditions induced by these information plus some intuitive conditions lead
to a unique ... | computer science |
35,499 | Towards Physarum robots: computing and manipulating on water surface | cs.RO | Plasmodium of Physarym polycephalum is an ideal biological substrate for
implementing concurrent and parallel computation, including combinatorial
geometry and optimization on graphs. We report results of scoping experiments
on Physarum computing in conditions of minimal friction, on the water surface.
We show that pla... | computer science |
35,500 | Causal models have no complete axiomatic characterization | cs.AI | Markov networks and Bayesian networks are effective graphic representations
of the dependencies embedded in probabilistic models. It is well known that
independencies captured by Markov networks (called graph-isomorphs) have a
finite axiomatic characterization. This paper, however, shows that
independencies captured by... | computer science |
35,501 | An Analysis of Key Factors for the Success of the Communal Management of
Knowledge | cs.HC | This paper explores the links between Knowledge Management and new
community-based models of the organization from both a theoretical and an
empirical perspective. From a theoretical standpoint, we look at Communities of
Practice (CoPs) and Knowledge Management (KM) and explore the links between the
two as they relate ... | computer science |
35,502 | Grainy Numbers | cs.LO | Grainy numbers are defined as tuples of bits. They form a lattice where the
meet and the join operations are an addition and a multiplication. They may be
substituted for the real numbers in the definition of fuzzy sets. The aim is to
propose an alternative negation for the complement that we'll call supplement. | computer science |
35,503 | SimDialog: A visual game dialog editor | cs.HC | SimDialog is a visual editor for dialog in computer games. This paper
presents the design of SimDialog, illustrating how script writers and
non-programmers can easily create dialog for video games with complex branching
structures and dynamic response characteristics. The system creates dialog as a
directed graph. This... | computer science |
35,504 | A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem | cs.AI | Determining the evolutionary history of a given biological data is an
important task in biological sciences. Given a set of quartet topologies over a
set of taxa, the Maximum Quartet Consistency (MQC) problem consists of
computing a global phylogeny that satisfies the maximum number of quartets. A
number of solutions h... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.