Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,107 | aspcud: A Linux Package Configuration Tool Based on Answer Set
Programming | cs.AI | We present the Linux package configuration tool aspcud based on Answer Set
Programming. In particular, we detail aspcud's preprocessor turning a CUDF
specification into a set of logical facts. | computer science |
36,108 | (Re)configuration based on model generation | cs.AI | Reconfiguration is an important activity for companies selling configurable
products or services which have a long life time. However, identification of a
set of required changes in a legacy configuration is a hard problem, since even
small changes in the requirements might imply significant modifications. In
this pape... | computer science |
36,109 | ATP and Presentation Service for Mizar Formalizations | cs.DL | This paper describes the Automated Reasoning for Mizar (MizAR) service, which
integrates several automated reasoning, artificial intelligence, and
presentation tools with Mizar and its authoring environment. The service
provides ATP assistance to Mizar authors in finding and explaining proofs, and
offers generation of ... | computer science |
36,110 | Visual Inference Specification Methods for Modularized Rulebases.
Overview and Integration Proposal | cs.AI | The paper concerns selected rule modularization techniques. Three visual
methods for inference specification for modularized rule- bases are described:
Drools Flow, BPMN and XTT2. Drools Flow is a popular technology for workflow or
process modeling, BPMN is an OMG standard for modeling business processes, and
XTT2 is a... | computer science |
36,111 | Lifted Unit Propagation for Effective Grounding | cs.LO | A grounding of a formula $\phi$ over a given finite domain is a ground
formula which is equivalent to $\phi$ on that domain. Very effective
propositional solvers have made grounding-based methods for problem solving
increasingly important, however for realistic problem domains and instances,
the size of groundings is o... | computer science |
36,112 | Conceptual Knowledge Markup Language: The central core | cs.DL | The conceptual knowledge framework OML/CKML needs several components for a
successful design. One important, but previously overlooked, component is the
central core of OML/CKML. The central core provides a theoretical link between
the ontological specification in OML and the conceptual knowledge
representation in CKML... | computer science |
36,113 | The Complexity of Approximating a Bethe Equilibrium | cs.AI | This paper resolves a common complexity issue in the Bethe approximation of
statistical physics and the Belief Propagation (BP) algorithm of artificial
intelligence. The Bethe approximation and the BP algorithm are heuristic
methods for estimating the partition function and marginal probabilities in
graphical models, r... | computer science |
36,114 | Conjure Revisited: Towards Automated Constraint Modelling | cs.AI | Automating the constraint modelling process is one of the key challenges
facing the constraints field, and one of the principal obstacles preventing
widespread adoption of constraint solving. This paper focuses on the
refinement-based approach to automated modelling, where a user specifies a
problem in an abstract cons... | computer science |
36,115 | Digital Libraries, Conceptual Knowledge Systems, and the Nebula
Interface | cs.DL | Concept Analysis provides a principled approach to effective management of
wide area information systems, such as the Nebula File System and Interface.
This not only offers evidence to support the assertion that a digital library
is a bounded collection of incommensurate information sources in a logical
space, but also... | computer science |
36,116 | A Framework for Sequential Planning in Multi-Agent Settings | cs.AI | This paper extends the framework of partially observable Markov decision
processes (POMDPs) to multi-agent settings by incorporating the notion of agent
models into the state space. Agents maintain beliefs over physical states of
the environment and over models of other agents, and they use Bayesian updates
to maintain... | computer science |
36,117 | Feature-Based Matrix Factorization | cs.AI | Recommender system has been more and more popular and widely used in many
applications recently. The increasing information available, not only in
quantities but also in types, leads to a big challenge for recommender system
that how to leverage these rich information to get a better performance. Most
traditional appro... | computer science |
36,118 | The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary
Report | cs.PL | We report about the current state and designated features of the tool
SeaLion, aimed to serve as an integrated development environment (IDE) for
answer-set programming (ASP). A main goal of SeaLion is to provide a
user-friendly environment for supporting a developer to write, evaluate, debug,
and test answer-set progra... | computer science |
36,119 | A Visual Entity-Relationship Model for Constraint-Based University
Timetabling | cs.AI | University timetabling (UTT) is a complex problem due to its combinatorial
nature but also the type of constraints involved. The holy grail of
(constraint) programming: "the user states the problem the program solves it"
remains a challenge since solution quality is tightly coupled with deriving
"effective models", bes... | computer science |
36,120 | Distributed Air Traffic Control : A Human Safety Perspective | cs.MA | The issues in air traffic control have so far been addressed with the intent
to improve resource utilization and achieve an optimized solution with respect
to fuel comsumption of aircrafts, efficient usage of the available airspace
with minimal congestion related losses under various dynamic constraints. So
the focus h... | computer science |
36,121 | Poultry Diseases Expert System using Dempster-Shafer Theory | cs.AI | Based on World Health Organization (WHO) fact sheet in the 2011, outbreaks of
poultry diseases especially Avian Influenza in poultry may raise global public
health concerns due to their effect on poultry populations, their potential to
cause serious disease in people, and their pandemic potential. In this
research, we ... | computer science |
36,122 | No-Regret Learning in Extensive-Form Games with Imperfect Recall | cs.GT | Counterfactual Regret Minimization (CFR) is an efficient no-regret learning
algorithm for decision problems modeled as extensive games. CFR's regret bounds
depend on the requirement of perfect recall: players always remember
information that was revealed to them and the order in which it was revealed.
In games without ... | computer science |
36,123 | African Trypanosomiasis Detection using Dempster-Shafer Theory | cs.AI | World Health Organization reports that African Trypanosomiasis affects mostly
poor populations living in remote rural areas of Africa that can be fatal if
properly not treated. This paper presents Dempster-Shafer Theory for the
detection of African trypanosomiasis. Sustainable elimination of African
trypanosomiasis as ... | computer science |
36,124 | VIQI: A New Approach for Visual Interpretation of Deep Web Query
Interfaces | cs.IR | Deep Web databases contain more than 90% of pertinent information of the Web.
Despite their importance, users don't profit of this treasury. Many deep web
services are offering competitive services in term of prices, quality of
service, and facilities. As the number of services is growing rapidly, users
have difficulty... | computer science |
36,125 | Document summarization using positive pointwise mutual information | cs.IR | The degree of success in document summarization processes depends on the
performance of the method used in identifying significant sentences in the
documents. The collection of unique words characterizes the major signature of
the document, and forms the basis for Term-Sentence-Matrix (TSM). The Positive
Pointwise Mutu... | computer science |
36,126 | The non-algorithmic side of the mind | cs.AI | The existence of a non-algorithmic side of the mind, conjectured by Penrose
on the basis of G\"odel's first incompleteness theorem, is investigated here in
terms of a quantum metalanguage. We suggest that, besides human ordinary
thought, which can be formalized in a computable, logical language, there is
another import... | computer science |
36,127 | Effects of Treatment on the Treated: Identification and Generalization | stat.ME | Many applications of causal analysis call for assessing, retrospectively, the
effect of withholding an action that has in fact been implemented. This
counterfactual quantity, sometimes called "effect of treatment on the treated,"
(ETT) have been used to to evaluate educational programs, critic public
policies, and just... | computer science |
36,128 | Exact Structure Discovery in Bayesian Networks with Less Space | cs.AI | The fastest known exact algorithms for scorebased structure discovery in
Bayesian networks on n nodes run in time and space 2nnO(1). The usage of these
algorithms is limited to networks on at most around 25 nodes mainly due to the
space requirement. Here, we study space-time tradeoffs for finding an optimal
network str... | computer science |
36,129 | MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts | cs.AI | We consider the task of obtaining the maximum a posteriori estimate of
discrete pairwise random fields with arbitrary unary potentials and semimetric
pairwise potentials. For this problem, we propose an accurate hierarchical move
making strategy where each move is computed efficiently by solving an st-MINCUT
problem. U... | computer science |
36,130 | Monolingual Probabilistic Programming Using Generalized Coroutines | cs.PL | Probabilistic programming languages and modeling toolkits are two modular
ways to build and reuse stochastic models and inference procedures. Combining
strengths of both, we express models and inference as generalized coroutines in
the same general-purpose language. We use existing facilities of the language,
such as r... | computer science |
36,131 | Temporal Action-Graph Games: A New Representation for Dynamic Games | cs.GT | In this paper we introduce temporal action graph games (TAGGs), a novel
graphical representation of imperfect-information extensive form games. We show
that when a game involves anonymity or context-specific utility independencies,
its encoding as a TAGG can be much more compact than its direct encoding as a
multiagent... | computer science |
36,132 | First-Order Mixed Integer Linear Programming | cs.LO | Mixed integer linear programming (MILP) is a powerful representation often
used to formulate decision-making problems under uncertainty. However, it lacks
a natural mechanism to reason about objects, classes of objects, and relations.
First-order logic (FOL), on the other hand, excels at reasoning about classes
of obje... | computer science |
36,133 | Distributed Parallel Inference on Large Factor Graphs | cs.AI | As computer clusters become more common and the size of the problems
encountered in the field of AI grows, there is an increasing demand for
efficient parallel inference algorithms. We consider the problem of parallel
inference on large factor graphs in the distributed memory setting of computer
clusters. We develop a ... | computer science |
36,134 | The Good, the Bad, and the Odd: Cycles in Answer-Set Programs | cs.AI | Backdoors of answer-set programs are sets of atoms that represent clever
reasoning shortcuts through the search space. Assignments to backdoor atoms
reduce the given program to several programs that belong to a tractable target
class. Previous research has considered target classes based on notions of
acyclicity where ... | computer science |
36,135 | Inferring Taxi Status Using GPS Trajectories | cs.AI | In this paper, we infer the statuses of a taxi, consisting of occupied,
non-occupied and parked, in terms of its GPS trajectory. The status information
can enable urban computing for improving a city's transportation systems and
land use planning. In our solution, we first identify and extract a set of
effective featur... | computer science |
36,136 | The View-Update Problem for Indefinite Databases | cs.DB | This paper introduces and studies a declarative framework for updating views
over indefinite databases. An indefinite database is a database with null
values that are represented, following the standard database approach, by a
single null constant. The paper formalizes views over such databases as
indefinite deductive ... | computer science |
36,137 | A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing
Problem | math.OC | This paper addresses a mixed integer programming (MIP) formulation for the
multi-item uncapacitated lot-sizing problem that is inspired from the trailer
manufacturer. The proposed MIP model has been utilized to find out the optimum
order quantity, optimum order time, and the minimum total cost of purchasing,
ordering, ... | computer science |
36,138 | Map-aided Fusion Using Evidential Grids for Mobile Perception in Urban
Environment | cs.RO | Evidential grids have been recently used for mobile object perception. The
novelty of this article is to propose a perception scheme using prior map
knowledge. A geographic map is considered an additional source of information
fused with a grid representing sensor data. Yager's rule is adapted to exploit
the Dempster-S... | computer science |
36,139 | Generalizing Redundancy in Propositional Logic: Foundations and Hitting
Sets Duality | cs.LO | Detection and elimination of redundant clauses from propositional formulas in
Conjunctive Normal Form (CNF) is a fundamental problem with numerous
application domains, including AI, and has been the subject of extensive
research. Moreover, a number of recent applications motivated various
extensions of this problem. Fo... | computer science |
36,140 | Prediction, Expectation, and Surprise: Methods, Designs, and Study of a
Deployed Traffic Forecasting Service | cs.AI | We present research on developing models that forecast traffic flow and
congestion in the Greater Seattle area. The research has led to the deployment
of a service named JamBayes, that is being actively used by over 2,500 users
via smartphones and desktop versions of the system. We review the modeling
effort and descri... | computer science |
36,141 | Local Utility Elicitation in GAI Models | cs.GT | Structured utility models are essential for the effective representation and
elicitation of complex multiattribute utility functions. Generalized additive
independence (GAI) models provide an attractive structural model of user
preferences, offering a balanced tradeoff between simplicity and applicability.
While repres... | computer science |
36,142 | Towards Characterizing Markov Equivalence Classes for Directed Acyclic
Graphs with Latent Variables | stat.ME | It is well known that there may be many causal explanations that are
consistent with a given set of data. Recent work has been done to represent the
common aspects of these explanations into one representation. In this paper, we
address what is less well known: how do the relationships common to every
causal explanatio... | computer science |
36,143 | Common Voting Rules as Maximum Likelihood Estimators | cs.GT | Voting is a very general method of preference aggregation. A voting rule
takes as input every voter's vote (typically, a ranking of the alternatives),
and produces as output either just the winning alternative or a ranking of the
alternatives. One potential view of voting is the following. There exists a
'correct' outc... | computer science |
36,144 | Counterexample-guided Planning | cs.AI | Planning in adversarial and uncertain environments can be modeled as the
problem of devising strategies in stochastic perfect information games. These
games are generalizations of Markov decision processes (MDPs): there are two
(adversarial) players, and a source of randomness. The main practical obstacle
to computing ... | computer science |
36,145 | Counterfactual Reasoning in Linear Structural Equation Models | cs.AI | Consider the case where causal relations among variables can be described as
a Gaussian linear structural equation model. This paper deals with the problem
of clarifying how the variance of a response variable would have changed if a
treatment variable were assigned to some value (counterfactually), given that a
set of... | computer science |
36,146 | Planning in POMDPs Using Multiplicity Automata | cs.AI | Planning and learning in Partially Observable MDPs (POMDPs) are among the
most challenging tasks in both the AI and Operation Research communities.
Although solutions to these problems are intractable in general, there might be
special cases, such as structured POMDPs, which can be solved efficiently. A
natural and pos... | computer science |
36,147 | On the Number of Experiments Sufficient and in the Worst Case Necessary
to Identify All Causal Relations Among N Variables | cs.AI | We show that if any number of variables are allowed to be simultaneously and
independently randomized in any one experiment, log2(N) + 1 experiments are
sufficient and in the worst case necessary to determine the causal relations
among N >= 2 variables when no latent variables, no sample selection bias and
no feedback ... | computer science |
36,148 | Unstructuring User Preferences: Efficient Non-Parametric Utility
Revelation | cs.AI | Tackling the problem of ordinal preference revelation and reasoning, we
propose a novel methodology for generating an ordinal utility function from a
set of qualitative preference statements. To the best of our knowledge, our
proposal constitutes the first nonparametric solution for this problem that is
both efficient ... | computer science |
36,149 | The Graphical Identification for Total Effects by using Surrogate
Variables | stat.ME | Consider the case where cause-effect relationships between variables can be
described as a directed acyclic graph and the corresponding linear structural
equation model. This paper provides graphical identifiability criteria for
total effects by using surrogate variables in the case where it is difficult to
observe a t... | computer science |
36,150 | On the optimality of tree-reweighted max-product message-passing | cs.AI | Tree-reweighted max-product (TRW) message passing is a modified form of the
ordinary max-product algorithm for attempting to find minimal energy
configurations in Markov random field with cycles. For a TRW fixed point
satisfying the strong tree agreement condition, the algorithm outputs a
configuration that is provably... | computer science |
36,151 | Robotic Mapping with Polygonal Random Fields | cs.RO | Two types of probabilistic maps are popular in the mobile robotics
literature: occupancy grids and geometric maps. Occupancy grids have the
advantages of simplicity and speed, but they represent only a restricted class
of maps and they make incorrect independence assumptions. On the other hand,
current geometric approa... | computer science |
36,152 | Description Logics with Fuzzy Concrete Domains | cs.AI | We present a fuzzy version of description logics with concrete domains. Main
features are: (i) concept constructors are based on t-norm, t-conorm, negation
and implication; (ii) concrete domains are fuzzy sets; (iii) fuzzy modifiers
are allowed; and (iv) the reasoning algorithm is based on a mixture of
completion rules... | computer science |
36,153 | Bayes' Bluff: Opponent Modelling in Poker | cs.GT | Poker is a challenging problem for artificial intelligence, with
non-deterministic dynamics, partial observability, and the added difficulty of
unknown adversaries. Modelling all of the uncertainties in this domain is not
an easy task. In this paper we present a Bayesian probabilistic model for a
broad class of poker g... | computer science |
36,154 | A Transformational Characterization of Markov Equivalence for Directed
Acyclic Graphs with Latent Variables | cs.AI | Different directed acyclic graphs (DAGs) may be Markov equivalent in the
sense that they entail the same conditional independence relations among the
observed variables. Chickering (1995) provided a transformational
characterization of Markov equivalence for DAGs (with no latent variables),
which is useful in deriving ... | computer science |
36,155 | Qualitative Decision Making Under Possibilistic Uncertainty: Toward more
discriminating criteria | cs.AI | The aim of this paper is to propose a generalization of previous approaches
in qualitative decision making. Our work is based on the binary possibilistic
utility (PU), which is a possibilistic counterpart of Expected Utility (EU).We
first provide a new axiomatization of PU and study its relation with the
lexicographic ... | computer science |
36,156 | Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge
Replacement | stat.ME | Maximal ancestral graphs (MAGs) are used to encode conditional independence
relations in DAG models with hidden variables. Different MAGs may represent the
same set of conditional independences and are called Markov equivalent. This
paper considers MAGs without undirected edges and shows conditions under which
an arrow... | computer science |
36,157 | Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation? | cs.AI | Extracting a subset of a given OWL ontology that captures all the ontology's
knowledge about a specified set of terms is a well-understood task. This task
can be based, for instance, on locality-based modules (LBMs). These come in two
flavours, syntactic and semantic, and a syntactic LBM is known to contain the
corresp... | computer science |
36,158 | Minimal Proof Search for Modal Logic K Model Checking | cs.AI | Most modal logics such as S5, LTL, or ATL are extensions of Modal Logic K.
While the model checking problems for LTL and to a lesser extent ATL have been
very active research areas for the past decades, the model checking problem for
the more basic Multi-agent Modal Logic K (MMLK) has important applications as a
formal... | computer science |
36,159 | Rule Based Expert System for Diagnosis of Neuromuscular Disorders | cs.CY | In this paper, we discuss the implementation of a rule based expert system
for diagnosing neuromuscular diseases. The proposed system is implemented as a
rule based expert system in JESS for the diagnosis of Cerebral Palsy, Multiple
Sclerosis, Muscular Dystrophy and Parkinson's disease. In the system, the user
is prese... | computer science |
36,160 | Effective Enabling of Sharing and Reuse of Knowledge On Semantic Web by
Ontology in Date Fruit Model | cs.AI | Since Organizations have recognized that knowledge constitutes a valuable
intangible asset for creating and sustaining competitive advantages, knowledge
sharing has a vital role in present society. It is an activity through which
information is exchanged among people through different media. Many problems
face the area... | computer science |
36,161 | On Formal Specification of Maple Programs | cs.MS | This paper is an example-based demonstration of our initial results on the
formal specification of programs written in the computer algebra language
MiniMaple (a substantial subset of Maple with slight extensions). The main goal
of this work is to define a verification framework for MiniMaple. Formal
specification of M... | computer science |
36,162 | LPC(ID): A Sequent Calculus Proof System for Propositional Logic
Extended with Inductive Definitions | cs.LO | The logic FO(ID) uses ideas from the field of logic programming to extend
first order logic with non-monotone inductive definitions. Such logic formally
extends logic programming, abductive logic programming and datalog, and thus
formalizes the view on these formalisms as logics of (generalized) inductive
definitions. ... | computer science |
36,163 | Conceptual Modelling and The Quality of Ontologies: Endurantism Vs.
Perdurantism | cs.AI | Ontologies are key enablers for sharing precise and machine-understandable
semantics among different applications and parties. Yet, for ontologies to meet
these expectations, their quality must be of a good standard. The quality of an
ontology is strongly based on the design method employed. This paper addresses
the de... | computer science |
36,164 | A GPS Pseudorange Based Cooperative Vehicular Distance Measurement
Technique | cs.AI | Accurate vehicular localization is important for various cooperative vehicle
safety (CVS) applications such as collision avoidance, turning assistant, etc.
In this paper, we propose a cooperative vehicular distance measurement
technique based on the sharing of GPS pseudorange measurements and a weighted
least squares m... | computer science |
36,165 | Set-valued dynamic treatment regimes for competing outcomes | stat.ME | Dynamic treatment regimes operationalize the clinical decision process as a
sequence of functions, one for each clinical decision, where each function
takes as input up-to-date patient information and gives as output a single
recommended treatment. Current methods for estimating optimal dynamic treatment
regimes, for e... | computer science |
36,166 | On finding minimal w-cutset | cs.DS | The complexity of a reasoning task over a graphical model is tied to the
induced width of the underlying graph. It is well-known that the conditioning
(assigning values) on a subset of variables yields a subproblem of the reduced
complexity where instantiated variables are removed. If the assigned variables
constitute ... | computer science |
36,167 | Pre-Selection of Independent Binary Features: An Application to
Diagnosing Scrapie in Sheep | cs.AI | Suppose that the only available information in a multi-class problem are
expert estimates of the conditional probabilities of occurrence for a set of
binary features. The aim is to select a subset of features to be measured in
subsequent data collection experiments. In the lack of any information about
the dependencies... | computer science |
36,168 | Identifying Conditional Causal Effects | cs.AI | This paper concerns the assessment of the effects of actions from a
combination of nonexperimental data and causal assumptions encoded in the form
of a directed acyclic graph in which some variables are presumed to be
unobserved. We provide a procedure that systematically identifies cause effects
between two sets of va... | computer science |
36,169 | Robustness of Causal Claims | cs.AI | A causal claim is any assertion that invokes causal relationships between
variables, for example that a drug has a certain effect on preventing a
disease. Causal claims are established through a combination of data and a set
of causal assumptions called a causal model. A claim is robust when it is
insensitive to violat... | computer science |
36,170 | Robust Probabilistic Inference in Distributed Systems | cs.AI | Probabilistic inference problems arise naturally in distributed systems such
as sensor networks and teams of mobile robots. Inference algorithms that use
message passing are a natural fit for distributed systems, but they must be
robust to the failure situations that arise in real-world settings, such as
unreliable com... | computer science |
36,171 | Ontology for Cellular Communication | cs.SE | The lack of interoperability between mobile cellular access networks has long
been a challenging obstacle, which telecommunication engineering is trying to
overcome. In second generation networks for example, this problem lies in the
fact that there are multiple standards. Each of these standards can operate in
the sam... | computer science |
36,172 | Probability Bracket Notation, Multivariable Systems and Static Bayesian
Networks | cs.AI | Probability Bracket Notation (PBN) is applied to systems of multiple random
variables for preliminary study of static Bayesian Networks (BN) and
Probabilistic Graphic Models (PGM). The famous Student BN Example is explored
to show the local independences and reasoning power of a BN. Software package
Elvira is used to g... | computer science |
36,173 | Achieving Approximate Soft Clustering in Data Streams | cs.DS | In recent years, data streaming has gained prominence due to advances in
technologies that enable many applications to generate continuous flows of
data. This increases the need to develop algorithms that are able to
efficiently process data streams. Additionally, real-time requirements and
evolving nature of data stre... | computer science |
36,174 | Evolving knowledge through negotiation | cs.AI | Semantic web information is at the extremities of long pipelines held by
human beings. They are at the origin of information and they will consume it
either explicitly because the information will be delivered to them in a
readable way, or implicitly because the computer processes consuming this
information will affect... | computer science |
36,175 | FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II
and Friends | cs.LO | A converter from first-order modal logics to classical higher- order logic is
presented. This tool enables the application of off-the-shelf higher-order
theorem provers and model finders for reasoning within first- order modal
logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to
constant, varyin... | computer science |
36,176 | The Semantic Web takes Wing: Programming Ontologies with Tawny-OWL | cs.AI | The Tawny-OWL library provides a fully-programmatic environment for ontology
building; it enables the use of a rich set of tools for ontology development,
by recasting development as a form of programming. It is built in Clojure - a
modern Lisp dialect, and is backed by the OWL API. Used simply, it has a
similar syntax... | computer science |
36,177 | Restricted Manipulation in Iterative Voting: Convergence and Condorcet
Efficiency | cs.AI | In collective decision making, where a voting rule is used to take a
collective decision among a group of agents, manipulation by one or more agents
is usually considered negative behavior to be avoided, or at least to be made
computationally difficult for the agents to perform. However, there are
scenarios in which a ... | computer science |
36,178 | LT^2C^2: A language of thought with Turing-computable Kolmogorov
complexity | cs.AI | In this paper, we present a theoretical effort to connect the theory of
program size to psychology by implementing a concrete language of thought with
Turing-computable Kolmogorov complexity (LT^2C^2) satisfying the following
requirements: 1) to be simple enough so that the complexity of any given finite
binary sequenc... | computer science |
36,179 | Causality in concurrent systems | cs.DC | Concurrent systems identify systems, either software, hardware or even
biological systems, that are characterized by sets of independent actions that
can be executed in any order or simultaneously. Computer scientists resort to a
causal terminology to describe and analyse the relations between the actions in
these syst... | computer science |
36,180 | Fairness in Academic Course Timetabling | cs.AI | We consider the problem of creating fair course timetables in the setting of
a university. Our motivation is to improve the overall satisfaction of
individuals concerned (students, teachers, etc.) by providing a fair timetable
to them. The central idea is that undesirable arrangements in the course
timetable, i.e., vio... | computer science |
36,181 | Towards Automated Proof Strategy Generalisation | cs.LO | The ability to automatically generalise (interactive) proofs and use such
generalisations to discharge related conjectures is a very hard problem which
remains unsolved. Here, we develop a notion of goal types to capture key
properties of goals, which enables abstractions over the specific order and
number of sub-goals... | computer science |
36,182 | A new type of judgement theorems for attribute characters in information
system | cs.DS | The research of attribute characters in information system which contains
core, necessary, unnecessary is a basic and important issue in attribute
reduct. Many methods for the judgement of attribute characters are based on the
relationship between the objects and attributes. In this paper, a new type of
judgement theor... | computer science |
36,183 | Separating Topology and Geometry in Space Planning | cs.AI | We are dealing with the problem of space layout planning here. We present an
architectural conceptual CAD approach. Starting with design specifications in
terms of constraints over spaces, a specific enumeration heuristics leads to a
complete set of consistent conceptual design solutions named topological
solutions. Th... | computer science |
36,184 | Quasi Conjunction, Quasi Disjunction, T-norms and T-conorms:
Probabilistic Aspects | math.PR | We make a probabilistic analysis related to some inference rules which play
an important role in nonmonotonic reasoning. In a coherence-based setting, we
study the extensions of a probability assessment defined on $n$ conditional
events to their quasi conjunction, and by exploiting duality, to their quasi
disjunction. ... | computer science |
36,185 | Empirical Probabilities in Monadic Deductive Databases | cs.AI | We address the problem of supporting empirical probabilities in monadic logic
databases. Though the semantics of multivalued logic programs has been studied
extensively, the treatment of probabilities as results of statistical findings
has not been studied in logic programming/deductive databases. We develop a
model-th... | computer science |
36,186 | ARCO1: An Application of Belief Networks to the Oil Market | cs.AI | Belief networks are a new, potentially important, class of knowledge-based
models. ARCO1, currently under development at the Atlantic Richfield Company
(ARCO) and the University of Southern California (USC), is the most advanced
reported implementation of these models in a financial forecasting setting.
ARCO1's underly... | computer science |
36,187 | Bayesian Networks Aplied to Therapy Monitoring | cs.AI | We propose a general Bayesian network model for application in a wide class
of problems of therapy monitoring. We discuss the use of stochastic simulation
as a computational approach to inference on the proposed class of models. As an
illustration we present an application to the monitoring of cytotoxic
chemotherapy in... | computer science |
36,188 | A Logic of Graded Possibility and Certainty Coping with Partial
Inconsistency | cs.AI | A semantics is given to possibilistic logic, a logic that handles weighted
classical logic formulae, and where weights are interpreted as lower bounds on
degrees of certainty or possibility, in the sense of Zadeh's possibility
theory. The proposed semantics is based on fuzzy sets of interpretations. It is
tolerant to p... | computer science |
36,189 | Heart Disease Prediction System using Associative Classification and
Genetic Algorithm | cs.AI | Associative classification is a recent and rewarding technique which
integrates association rule mining and classification to a model for prediction
and achieves maximum accuracy. Associative classifiers are especially fit to
applications where maximum accuracy is desired to a model for prediction. There
are many domai... | computer science |
36,190 | On the speed of constraint propagation and the time complexity of arc
consistency testing | cs.LO | Establishing arc consistency on two relational structures is one of the most
popular heuristics for the constraint satisfaction problem. We aim at
determining the time complexity of arc consistency testing. The input
structures $G$ and $H$ can be supposed to be connected colored graphs, as the
general problem reduces t... | computer science |
36,191 | Semantic Matching of Security Policies to Support Security Experts | cs.CR | Management of security policies has become increasingly difficult given the
number of domains to manage, taken into consideration their extent and their
complexity. Security experts has to deal with a variety of frameworks and
specification languages used in different domains that may belong to any Cloud
Computing or D... | computer science |
36,192 | Design for a Darwinian Brain: Part 1. Philosophy and Neuroscience | cs.AI | Physical symbol systems are needed for open-ended cognition. A good way to
understand physical symbol systems is by comparison of thought to chemistry.
Both have systematicity, productivity and compositionality. The state of the
art in cognitive architectures for open-ended cognition is critically assessed.
I conclude ... | computer science |
36,193 | Symmetries in Modal Logics | cs.LO | We generalize the notion of symmetries of propositional formulas in
conjunctive normal form to modal formulas. Our framework uses the coinductive
models and, hence, the results apply to a wide class of modal logics including,
for example, hybrid logics. Our main result shows that the symmetries of a
modal formula prese... | computer science |
36,194 | Agent-based modeling of a price information trading business | cs.AI | We describe an agent-based simulation of a fictional (but feasible)
information trading business. The Gas Price Information Trader (GPIT) buys
information about real-time gas prices in a metropolitan area from drivers and
resells the information to drivers who need to refuel their vehicles.
Our simulation uses real w... | computer science |
36,195 | Artificial Intelligence Based Cognitive Routing for Cognitive Radio
Networks | cs.NI | Cognitive radio networks (CRNs) are networks of nodes equipped with cognitive
radios that can optimize performance by adapting to network conditions. While
cognitive radio networks (CRN) are envisioned as intelligent networks,
relatively little research has focused on the network level functionality of
CRNs. Although v... | computer science |
36,196 | Sigma Point Belief Propagation | cs.AI | The sigma point (SP) filter, also known as unscented Kalman filter, is an
attractive alternative to the extended Kalman filter and the particle filter.
Here, we extend the SP filter to nonsequential Bayesian inference corresponding
to loopy factor graphs. We propose sigma point belief propagation (SPBP) as a
low-comple... | computer science |
36,197 | A Conflict-Based Path-Generation Heuristic for Evacuation Planning | cs.AI | Evacuation planning and scheduling is a critical aspect of disaster
management and national security applications. This paper proposes a
conflict-based path-generation approach for evacuation planning. Its key idea
is to generate evacuation routes lazily for evacuated areas and to optimize the
evacuation over these rou... | computer science |
36,198 | On SAT representations of XOR constraints | cs.CC | We study the representation of systems S of linear equations over the
two-element field (aka xor- or parity-constraints) via conjunctive normal forms
F (boolean clause-sets). First we consider the problem of finding an
"arc-consistent" representation ("AC"), meaning that unit-clause propagation
will fix all forced assi... | computer science |
36,199 | Cache Performance Study of Portfolio-Based Parallel CDCL SAT Solvers | cs.DC | Parallel SAT solvers are becoming mainstream. Their performance has made them
win the past two SAT competitions consecutively and are in the limelight of
research and industry. The problem is that it is not known exactly what is
needed to make them perform even better; that is, how to make them solve more
problems in l... | computer science |
36,200 | Modeling the Role of Context Dependency in the Recognition and
Manifestation of Entrepreneurial Opportunity | cs.AI | The paper uses the SCOP theory of concepts to model the role of environmental
context on three levels of entrepreneurial opportunity: idea generation, idea
development, and entrepreneurial decision. The role of contextual-fit in the
generation and development of ideas is modeled as the collapse of their
superposition s... | computer science |
36,201 | The multi-vehicle covering tour problem: building routes for urban
patrolling | cs.AI | In this paper we study a particular aspect of the urban community policing:
routine patrol route planning. We seek routes that guarantee visibility, as
this has a sizable impact on the community perceived safety, allowing quick
emergency responses and providing surveillance of selected sites (e.g.,
hospitals, schools).... | computer science |
36,202 | Generating Explanations for Biomedical Queries | cs.AI | We introduce novel mathematical models and algorithms to generate (shortest
or k different) explanations for biomedical queries, using answer set
programming. We implement these algorithms and integrate them in BIOQUERY-ASP.
We illustrate the usefulness of these methods with some complex biomedical
queries related to d... | computer science |
36,203 | On MAP Inference by MWSS on Perfect Graphs | cs.AI | Finding the most likely (MAP) configuration of a Markov random field (MRF) is
NP-hard in general. A promising, recent technique is to reduce the problem to
finding a maximum weight stable set (MWSS) on a derived weighted graph, which
if perfect, allows inference in polynomial time. We derive new results for this
approa... | computer science |
36,204 | Predicate Logic as a Modeling Language: Modeling and Solving some
Machine Learning and Data Mining Problems with IDP3 | cs.LO | This paper provides a gentle introduction to problem solving with the IDP3
system. The core of IDP3 is a finite model generator that supports first order
logic enriched with types, inductive definitions, aggregates and partial
functions. It offers its users a modeling language that is a slight extension
of predicate lo... | computer science |
36,205 | Investigation of commuting Hamiltonian in quantum Markov network | cs.AI | Graphical Models have various applications in science and engineering which
include physics, bioinformatics, telecommunication and etc. Usage of graphical
models needs complex computations in order to evaluation of marginal
functions,so there are some powerful methods including mean field
approximation, belief propagat... | computer science |
36,206 | Propagating Regular Counting Constraints | cs.AI | Constraints over finite sequences of variables are ubiquitous in sequencing
and timetabling. Moreover, the wide variety of such constraints in practical
applications led to general modelling techniques and generic propagation
algorithms, often based on deterministic finite automata (DFA) and their
extensions. We consid... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.