Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,002 | Local Diagnosis | cs.AI | In an earlier work, we have presented operations of belief change which only
affect the relevant part of a belief base. In this paper, we propose the
application of the same strategy to the problem of model-based diangosis. We
first isolate the subset of the system description which is relevant for a
given observation ... | computer science |
18,003 | A Consistency-Based Model for Belief Change: Preliminary Report | cs.AI | We present a general, consistency-based framework for belief change.
Informally, in revising K by A, we begin with A and incorporate as much of K as
consistently possible. Formally, a knowledge base K and sentence A are
expressed, via renaming propositions in K, in separate languages. Using a
maximization process, we a... | computer science |
18,004 | SATEN: An Object-Oriented Web-Based Revision and Extraction Engine | cs.AI | SATEN is an object-oriented web-based extraction and belief revision engine.
It runs on any computer via a Java 1.1 enabled browser such as Netscape 4.
SATEN performs belief revision based on the AGM approach. The extraction and
belief revision reasoning engines operate on a user specified ranking of
information. One o... | computer science |
18,005 | dcs: An Implementation of DATALOG with Constraints | cs.AI | Answer-set programming (ASP) has emerged recently as a viable programming
paradigm. We describe here an ASP system, DATALOG with constraints or DC, based
on non-monotonic logic. Informally, DC theories consist of propositional
clauses (constraints) and of Horn rules. The semantics is a simple and natural
extension of t... | computer science |
18,006 | DATALOG with constraints - an answer-set programming system | cs.AI | Answer-set programming (ASP) has emerged recently as a viable programming
paradigm well attuned to search problems in AI, constraint satisfaction and
combinatorics. Propositional logic is, arguably, the simplest ASP system with
an intuitive semantics supporting direct modeling of problem constraints.
However, for some ... | computer science |
18,007 | Some Remarks on Boolean Constraint Propagation | cs.AI | We study here the well-known propagation rules for Boolean constraints. First
we propose a simple notion of completeness for sets of such rules and establish
a completeness result. Then we show an equivalence in an appropriate sense
between Boolean constraint propagation and unit propagation, a form of
resolution for p... | computer science |
18,008 | Conditional Plausibility Measures and Bayesian Networks | cs.AI | A general notion of algebraic conditional plausibility measures is defined.
Probability measures, ranking functions, possibility measures, and (under the
appropriate definitions) sets of probability measures can all be viewed as
defining algebraic conditional plausibility measures. It is shown that
algebraic conditiona... | computer science |
18,009 | Constraint compiling into rules formalism constraint compiling into
rules formalism for dynamic CSPs computing | cs.AI | In this paper we present a rule based formalism for filtering variables
domains of constraints. This formalism is well adapted for solving dynamic CSP.
We take diagnosis as an instance problem to illustrate the use of these rules.
A diagnosis problem is seen like finding all the minimal sets of constraints to
be relaxe... | computer science |
18,010 | Brainstorm/J: a Java Framework for Intelligent Agents | cs.AI | Despite the effort of many researchers in the area of multi-agent systems
(MAS) for designing and programming agents, a few years ago the research
community began to take into account that common features among different MAS
exists. Based on these common features, several tools have tackled the problem
of agent develop... | computer science |
18,011 | On the relationship between fuzzy logic and four-valued relevance logic | cs.AI | In fuzzy propositional logic, to a proposition a partial truth in [0,1] is
assigned. It is well known that under certain circumstances, fuzzy logic
collapses to classical logic. In this paper, we will show that under dual
conditions, fuzzy logic collapses to four-valued (relevance) logic, where
propositions have truth-... | computer science |
18,012 | Causes and Explanations: A Structural-Model Approach, Part I: Causes | cs.AI | We propose a new definition of actual cause, using structural equations to
model counterfactuals. We show that the definition yields a plausible and
elegant account of causation that handles well examples which have caused
problems for other definitions and resolves major difficulties in the
traditional account. | computer science |
18,013 | Logic Programming Approaches for Representing and Solving Constraint
Satisfaction Problems: A Comparison | cs.AI | Many logic programming based approaches can be used to describe and solve
combinatorial search problems. On the one hand there is constraint logic
programming which computes a solution as an answer substitution to a query
containing the variables of the constraint satisfaction problem. On the other
hand there are syste... | computer science |
18,014 | Multi-Channel Parallel Adaptation Theory for Rule Discovery | cs.AI | In this paper, we introduce a new machine learning theory based on
multi-channel parallel adaptation for rule discovery. This theory is
distinguished from the familiar parallel-distributed adaptation theory of
neural networks in terms of channel-based convergence to the target rules. We
show how to realize this theory ... | computer science |
18,015 | A Constraint-Driven System for Contract Assembly | cs.AI | We present an approach for modelling the structure and coarse content of
legal documents with a view to providing automated support for the drafting of
contracts and contract database retrieval. The approach is designed to be
applicable where contract drafting is based on model-form contracts or on
existing examples of... | computer science |
18,016 | Modelling Contractual Arguments | cs.AI | One influential approach to assessing the "goodness" of arguments is offered
by the Pragma-Dialectical school (p-d) (Eemeren & Grootendorst 1992). This can
be compared with Rhetorical Structure Theory (RST) (Mann & Thompson 1988), an
approach that originates in discourse analysis. In p-d terms an argument is
good if it... | computer science |
18,017 | Information Integration and Computational Logic | cs.AI | Information Integration is a young and exciting field with enormous research
and commercial significance in the new world of the Information Society. It
stands at the crossroad of Databases and Artificial Intelligence requiring
novel techniques that bring together different methods from these fields.
Information from d... | computer science |
18,018 | Enhancing Constraint Propagation with Composition Operators | cs.AI | Constraint propagation is a general algorithmic approach for pruning the
search space of a CSP. In a uniform way, K. R. Apt has defined a computation as
an iteration of reduction functions over a domain. He has also demonstrated the
need for integrating static properties of reduction functions (commutativity
and semi-c... | computer science |
18,019 | On Properties of Update Sequences Based on Causal Rejection | cs.AI | We consider an approach to update nonmonotonic knowledge bases represented as
extended logic programs under answer set semantics. New information is
incorporated into the current knowledge base subject to a causal rejection
principle enforcing that, in case of conflicts, more recent rules are preferred
and older rules ... | computer science |
18,020 | Gradient-based Reinforcement Planning in Policy-Search Methods | cs.AI | We introduce a learning method called ``gradient-based reinforcement
planning'' (GREP). Unlike traditional DP methods that improve their policy
backwards in time, GREP is a gradient-based method that plans ahead and
improves its policy before it actually acts in the environment. We derive
formulas for the exact policy ... | computer science |
18,021 | Rational Competitive Analysis | cs.AI | Much work in computer science has adopted competitive analysis as a tool for
decision making under uncertainty. In this work we extend competitive analysis
to the context of multi-agent systems. Unlike classical competitive analysis
where the behavior of an agent's environment is taken to be arbitrary, we
consider the ... | computer science |
18,022 | A theory of experiment | cs.AI | This article aims at clarifying the language and practice of scientific
experiment, mainly by hooking observability on calculability. | computer science |
18,023 | Nonmonotonic Reasoning, Preferential Models and Cumulative Logics | cs.AI | Many systems that exhibit nonmonotonic behavior have been described and
studied already in the literature. The general notion of nonmonotonic
reasoning, though, has almost always been described only negatively, by the
property it does not enjoy, i.e. monotonicity. We study here general patterns
of nonmonotonic reasonin... | computer science |
18,024 | What does a conditional knowledge base entail? | cs.AI | This paper presents a logical approach to nonmonotonic reasoning based on the
notion of a nonmonotonic consequence relation. A conditional knowledge base,
consisting of a set of conditional assertions of the type "if ... then ...",
represents the explicit defeasible knowledge an agent has about the way the
world genera... | computer science |
18,025 | A note on Darwiche and Pearl | cs.AI | It is shown that Darwiche and Pearl's postulates imply an interesting
property, not noticed by the authors. | computer science |
18,026 | Distance Semantics for Belief Revision | cs.AI | A vast and interesting family of natural semantics for belief revision is
defined. Suppose one is given a distance d between any two models. One may then
define the revision of a theory K by a formula a as the theory defined by the
set of all those models of a that are closest, by d, to the set of models of K.
This fam... | computer science |
18,027 | Preferred History Semantics for Iterated Updates | cs.AI | We give a semantics to iterated update by a preference relation on possible
developments. An iterated update is a sequence of formulas, giving (incomplete)
information about successive states of the world. A development is a sequence
of models, describing a possible trajectory through time. We assume a principle
of ine... | computer science |
18,028 | Nonmonotonic inference operations | cs.AI | A. Tarski proposed the study of infinitary consequence operations as the
central topic of mathematical logic. He considered monotonicity to be a
property of all such operations. In this paper, we weaken the monotonicity
requirement and consider more general operations, inference operations. These
operations describe th... | computer science |
18,029 | The logical meaning of Expansion | cs.AI | The Expansion property considered by researchers in Social Choice is shown to
correspond to a logical property of nonmonotonic consequence relations that is
the {\em pure}, i.e., not involving connectives, version of a previously known
weak rationality condition. The assumption that the union of two definable sets
of m... | computer science |
18,030 | Another perspective on Default Reasoning | cs.AI | The lexicographic closure of any given finite set D of normal defaults is
defined. A conditional assertion "if a then b" is in this lexicographic closure
if, given the defaults D and the fact a, one would conclude b. The
lexicographic closure is essentially a rational extension of D, and of its
rational closure, define... | computer science |
18,031 | Deductive Nonmonotonic Inference Operations: Antitonic Representations | cs.AI | We provide a characterization of those nonmonotonic inference operations C
for which C(X) may be described as the set of all logical consequences of X
together with some set of additional assumptions S(X) that depends
anti-monotonically on X (i.e., X is a subset of Y implies that S(Y) is a subset
of S(X)). The operatio... | computer science |
18,032 | Stereotypical Reasoning: Logical Properties | cs.AI | Stereotypical reasoning assumes that the situation at hand is one of a kind
and that it enjoys the properties generally associated with that kind of
situation. It is one of the most basic forms of nonmonotonic reasoning. A
formal model for stereotypical reasoning is proposed and the logical properties
of this form of r... | computer science |
18,033 | A Framework for Compiling Preferences in Logic Programs | cs.AI | We introduce a methodology and framework for expressing general preference
information in logic programming under the answer set semantics. An ordered
logic program is an extended logic program in which rules are named by unique
terms, and in which preferences among rules are given by a set of atoms of form
s < t where... | computer science |
18,034 | Two results for proiritized logic programming | cs.AI | Prioritized default reasoning has illustrated its rich expressiveness and
flexibility in knowledge representation and reasoning. However, many important
aspects of prioritized default reasoning have yet to be thoroughly explored. In
this paper, we investigate two properties of prioritized logic programs in the
context ... | computer science |
18,035 | Belief Revision and Rational Inference | cs.AI | The (extended) AGM postulates for belief revision seem to deal with the
revision of a given theory K by an arbitrary formula, but not to constrain the
revisions of two different theories by the same formula. A new postulate is
proposed and compared with other similar postulates that have been proposed in
the literature... | computer science |
18,036 | Ultimate approximations in nonmonotonic knowledge representation systems | cs.AI | We study fixpoints of operators on lattices. To this end we introduce the
notion of an approximation of an operator. We order approximations by means of
a precision ordering. We show that each lattice operator O has a unique most
precise or ultimate approximation. We demonstrate that fixpoints of this
ultimate approxim... | computer science |
18,037 | Handling Defeasibilities in Action Domains | cs.AI | Representing defeasibility is an important issue in common sense reasoning.
In reasoning about action and change, this issue becomes more difficult because
domain and action related defeasible information may conflict with general
inertia rules. Furthermore, different types of defeasible information may also
interfere ... | computer science |
18,038 | Anticipatory Guidance of Plot | cs.AI | An anticipatory system for guiding plot development in interactive narratives
is described. The executable model is a finite automaton that provides the
implemented system with a look-ahead. The identification of undesirable future
states in the model is used to guide the player, in a transparent manner. In
this way, t... | computer science |
18,039 | Abduction, ASP and Open Logic Programs | cs.AI | Open logic programs and open entailment have been recently proposed as an
abstract framework for the verification of incomplete specifications based upon
normal logic programs and the stable model semantics. There are obvious
analogies between open predicates and abducible predicates. However, despite
superficial simil... | computer science |
18,040 | Domain-Dependent Knowledge in Answer Set Planning | cs.AI | In this paper we consider three different kinds of domain-dependent control
knowledge (temporal, procedural and HTN-based) that are useful in planning. Our
approach is declarative and relies on the language of logic programming with
answer set semantics (AnsProlog*). AnsProlog* is designed to plan without
control knowl... | computer science |
18,041 | "Minimal defence": a refinement of the preferred semantics for
argumentation frameworks | cs.AI | Dung's abstract framework for argumentation enables a study of the
interactions between arguments based solely on an ``attack'' binary relation on
the set of arguments. Various ways to solve conflicts between contradictory
pieces of information have been proposed in the context of argumentation,
nonmonotonic reasoning ... | computer science |
18,042 | Two Representations for Iterative Non-prioritized Change | cs.AI | We address a general representation problem for belief change, and describe
two interrelated representations for iterative non-prioritized change: a
logical representation in terms of persistent epistemic states, and a
constructive representation in terms of flocks of bases. | computer science |
18,043 | Collective Argumentation | cs.AI | An extension of an abstract argumentation framework, called collective
argumentation, is introduced in which the attack relation is defined directly
among sets of arguments. The extension turns out to be suitable, in particular,
for representing semantics of disjunctive logic programs. Two special kinds of
collective a... | computer science |
18,044 | Logic Programming with Ordered Disjunction | cs.AI | Logic programs with ordered disjunction (LPODs) combine ideas underlying
Qualitative Choice Logic (Brewka et al. KR 2002) and answer set programming.
Logic programming under answer set semantics is extended with a new connective
called ordered disjunction. The new connective allows us to represent
alternative, ranked o... | computer science |
18,045 | Compilation of Propositional Weighted Bases | cs.AI | In this paper, we investigate the extent to which knowledge compilation can
be used to improve inference from propositional weighted bases. We present a
general notion of compilation of a weighted base that is parametrized by any
equivalence--preserving compilation function. Both negative and positive
results are prese... | computer science |
18,046 | Modeling Complex Domains of Actions and Change | cs.AI | This paper studies the problem of modeling complex domains of actions and
change within high-level action description languages. We investigate two main
issues of concern: (a) can we represent complex domains that capture together
different problems such as ramifications, non-determinism and concurrency of
actions, at ... | computer science |
18,047 | Value Based Argumentation Frameworks | cs.AI | This paper introduces the notion of value-based argumentation frameworks, an
extension of the standard argumentation frameworks proposed by Dung, which are
able toshow how rational decision is possible in cases where arguments derive
their force from the social values their acceptance would promote. | computer science |
18,048 | Preferred well-founded semantics for logic programming by alternating
fixpoints: Preliminary report | cs.AI | We analyze the problem of defining well-founded semantics for ordered logic
programs within a general framework based on alternating fixpoint theory. We
start by showing that generalizations of existing answer set approaches to
preference are too weak in the setting of well-founded semantics. We then
specify some infor... | computer science |
18,049 | Embedding Default Logic in Propositional Argumentation Systems | cs.AI | In this paper we present a transformation of finite propositional default
theories into so-called propositional argumentation systems. This
transformation allows to characterize all notions of Reiter's default logic in
the framework of argumentation systems. As a consequence, computing extensions,
or determining wether... | computer science |
18,050 | On the existence and multiplicity of extensions in dialectical
argumentation | cs.AI | In the present paper, the existence and multiplicity problems of extensions
are addressed. The focus is on extension of the stable type. The main result of
the paper is an elegant characterization of the existence and multiplicity of
extensions in terms of the notion of dialectical justification, a close cousin
of the ... | computer science |
18,051 | Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic
Logic and Probabilistic Logic under Coherence | cs.AI | Recently, it has been shown that probabilistic entailment under coherence is
weaker than model-theoretic probabilistic entailment. Moreover, probabilistic
entailment under coherence is a generalization of default entailment in System
P. In this paper, we continue this line of research by presenting probabilistic
genera... | computer science |
18,052 | Evaluating Defaults | cs.AI | We seek to find normative criteria of adequacy for nonmonotonic logic similar
to the criterion of validity for deductive logic. Rather than stipulating that
the conclusion of an inference be true in all models in which the premises are
true, we require that the conclusion of a nonmonotonic inference be true in
``almost... | computer science |
18,053 | Linking Makinson and Kraus-Lehmann-Magidor preferential entailments | cs.AI | About ten years ago, various notions of preferential entailment have been
introduced. The main reference is a paper by Kraus, Lehmann and Magidor (KLM),
one of the main competitor being a more general version defined by Makinson
(MAK). These two versions have already been compared, but it is time to revisit
these compa... | computer science |
18,054 | Knowledge Representation | cs.AI | This work analyses main features that should be present in knowledge
representation. It suggests a model for representation and a way to implement
this model in software. Representation takes care of both low-level sensor
information and high-level concepts. | computer science |
18,055 | Causes and Explanations: A Structural-Model Approach. Part II:
Explanations | cs.AI | We propose new definitions of (causal) explanation, using structural
equations to model counterfactuals. The definition is based on the notion of
actual cause, as defined and motivated in a companion paper. Essentially, an
explanation is a fact that is not known for certain but, if found to be true,
would constitute an... | computer science |
18,056 | Reasoning about Evolving Nonmonotonic Knowledge Bases | cs.AI | Recently, several approaches to updating knowledge bases modeled as extended
logic programs have been introduced, ranging from basic methods to incorporate
(sequences of) sets of rules into a logic program, to more elaborate methods
which use an update policy for specifying how updates must be incorporated. In
this pap... | computer science |
18,057 | A Comparison of Different Cognitive Paradigms Using Simple Animats in a
Virtual Laboratory, with Implications to the Notion of Cognition | cs.AI | In this thesis I present a virtual laboratory which implements five different
models for controlling animats: a rule-based system, a behaviour-based system,
a concept-based system, a neural network, and a Braitenberg architecture.
Through different experiments, I compare the performance of the models and
conclude that ... | computer science |
18,058 | Revising Partially Ordered Beliefs | cs.AI | This paper deals with the revision of partially ordered beliefs. It proposes
a semantic representation of epistemic states by partial pre-orders on
interpretations and a syntactic representation by partially ordered belief
bases. Two revision operations, the revision stemming from the history of
observations and the po... | computer science |
18,059 | Can the whole brain be simpler than its "parts"? | cs.AI | This is the first in a series of connected papers discussing the problem of a
dynamically reconfigurable universal learning neurocomputer that could serve as
a computational model for the whole human brain. The whole series is entitled
"The Brain Zero Project. My Brain as a Dynamically Reconfigurable Universal
Learning... | computer science |
18,060 | Adaptive Development of Koncepts in Virtual Animats: Insights into the
Development of Knowledge | cs.AI | As a part of our effort for studying the evolution and development of
cognition, we present results derived from synthetic experimentations in a
virtual laboratory where animats develop koncepts adaptively and ground their
meaning through action. We introduce the term "koncept" to avoid confusions and
ambiguity derived... | computer science |
18,061 | Dynamic Adjustment of the Motivation Degree in an Action Selection
Mechanism | cs.AI | This paper presents a model for dynamic adjustment of the motivation degree,
using a reinforcement learning approach, in an action selection mechanism
previously developed by the authors. The learning takes place in the
modification of a parameter of the model of combination of internal and
external stimuli. Experiment... | computer science |
18,062 | Action Selection Properties in a Software Simulated Agent | cs.AI | This article analyses the properties of the Internal Behaviour network, an
action selection mechanism previously proposed by the authors, with the aid of
a simulation developed for such ends. A brief review of the Internal Behaviour
network is followed by the explanation of the implementation of the simulation.
Then, e... | computer science |
18,063 | A Model for Combination of External and Internal Stimuli in the Action
Selection of an Autonomous Agent | cs.AI | This paper proposes a model for combination of external and internal stimuli
for the action selection in an autonomous agent, based in an action selection
mechanism previously proposed by the authors. This combination model includes
additive and multiplicative elements, which allows to incorporate new
properties, which... | computer science |
18,064 | Searching for Plannable Domains can Speed up Reinforcement Learning | cs.AI | Reinforcement learning (RL) involves sequential decision making in uncertain
environments. The aim of the decision-making agent is to maximize the benefit
of acting in its environment over an extended period of time. Finding an
optimal policy in RL may be very slow. To speed up learning, one often used
solution is the ... | computer science |
18,065 | Temporal plannability by variance of the episode length | cs.AI | Optimization of decision problems in stochastic environments is usually
concerned with maximizing the probability of achieving the goal and minimizing
the expected episode length. For interacting agents in time-critical
applications, learning of the possibility of scheduling of subtasks (events) or
the full task is an ... | computer science |
18,066 | Comparisons and Computation of Well-founded Semantics for Disjunctive
Logic Programs | cs.AI | Much work has been done on extending the well-founded semantics to general
disjunctive logic programs and various approaches have been proposed. However,
these semantics are different from each other and no consensus is reached about
which semantics is the most intended. In this paper we look at disjunctive
well-founde... | computer science |
18,067 | A semantic framework for preference handling in answer set programming | cs.AI | We provide a semantic framework for preference handling in answer set
programming. To this end, we introduce preference preserving consequence
operators. The resulting fixpoint characterizations provide us with a uniform
semantic framework for characterizing preference handling in existing
approaches. Although our appr... | computer science |
18,068 | Defeasible Logic Programming: An Argumentative Approach | cs.AI | The work reported here introduces Defeasible Logic Programming (DeLP), a
formalism that combines results of Logic Programming and Defeasible
Argumentation. DeLP provides the possibility of representing information in the
form of weak rules in a declarative manner, and a defeasible argumentation
inference mechanism for ... | computer science |
18,069 | Constraint-based analysis of composite solvers | cs.AI | Cooperative constraint solving is an area of constraint programming that
studies the interaction between constraint solvers with the aim of discovering
the interaction patterns that amplify the positive qualities of individual
solvers. Automatisation and formalisation of such studies is an important issue
of cooperativ... | computer science |
18,070 | Kalman-filtering using local interactions | cs.AI | There is a growing interest in using Kalman-filter models for brain
modelling. In turn, it is of considerable importance to represent Kalman-filter
in connectionist forms with local Hebbian learning rules. To our best
knowledge, Kalman-filter has not been given such local representation. It seems
that the main obstacle... | computer science |
18,071 | On the Notion of Cognition | cs.AI | We discuss philosophical issues concerning the notion of cognition basing
ourselves in experimental results in cognitive sciences, especially in computer
simulations of cognitive systems. There have been debates on the "proper"
approach for studying cognition, but we have realized that all approaches can
be in theory e... | computer science |
18,072 | Unfolding Partiality and Disjunctions in Stable Model Semantics | cs.AI | The paper studies an implementation methodology for partial and disjunctive
stable models where partiality and disjunctions are unfolded from a logic
program so that an implementation of stable models for normal
(disjunction-free) programs can be used as the core inference engine. The
unfolding is done in two separate ... | computer science |
18,073 | Multi-target particle filtering for the probability hypothesis density | cs.AI | When tracking a large number of targets, it is often computationally
expensive to represent the full joint distribution over target states. In cases
where the targets move independently, each target can instead be tracked with a
separate filter. However, this leads to a model-data association problem.
Another approach ... | computer science |
18,074 | A Framework for Searching AND/OR Graphs with Cycles | cs.AI | Search in cyclic AND/OR graphs was traditionally known to be an unsolved
problem. In the recent past several important studies have been reported in
this domain. In this paper, we have taken a fresh look at the problem. First, a
new and comprehensive theoretical framework for cyclic AND/OR graphs has been
presented, wh... | computer science |
18,075 | On rho in a Decision-Theoretic Apparatus of Dempster-Shafer Theory | cs.AI | Thomas M. Strat has developed a decision-theoretic apparatus for
Dempster-Shafer theory (Decision analysis using belief functions, Intern. J.
Approx. Reason. 4(5/6), 391-417, 1990). In this apparatus, expected utility
intervals are constructed for different choices. The choice with the highest
expected utility is prefe... | computer science |
18,076 | Updating beliefs with incomplete observations | cs.AI | Currently, there is renewed interest in the problem, raised by Shafer in
1985, of updating probabilities when observations are incomplete. This is a
fundamental problem in general, and of particular interest for Bayesian
networks. Recently, Grunwald and Halpern have shown that commonly used updating
strategies fail in ... | computer science |
18,077 | Updating Probabilities | cs.AI | As examples such as the Monty Hall puzzle show, applying conditioning to
update a probability distribution on a ``naive space'', which does not take
into account the protocol used, can often lead to counterintuitive results.
Here we examine why. A criterion known as CAR (``coarsening at random'') in the
statistical lit... | computer science |
18,078 | Pruning Isomorphic Structural Sub-problems in Configuration | cs.AI | Configuring consists in simulating the realization of a complex product from
a catalog of component parts, using known relations between types, and picking
values for object attributes. This highly combinatorial problem in the field of
constraint programming has been addressed with a variety of approaches since
the fou... | computer science |
18,079 | Probabilistic Reasoning as Information Compression by Multiple
Alignment, Unification and Search: An Introduction and Overview | cs.AI | This article introduces the idea that probabilistic reasoning (PR) may be
understood as "information compression by multiple alignment, unification and
search" (ICMAUS). In this context, multiple alignment has a meaning which is
similar to but distinct from its meaning in bio-informatics, while unification
means a simp... | computer science |
18,080 | Information Compression by Multiple Alignment, Unification and Search as
a Unifying Principle in Computing and Cognition | cs.AI | This article presents an overview of the idea that "information compression
by multiple alignment, unification and search" (ICMAUS) may serve as a unifying
principle in computing (including mathematics and logic) and in such aspects of
human cognition as the analysis and production of natural language, fuzzy
pattern re... | computer science |
18,081 | Integrating cardinal direction relations and other orientation relations
in Qualitative Spatial Reasoning | cs.AI | We propose a calculus integrating two calculi well-known in Qualitative
Spatial Reasoning (QSR): Frank's projection-based cardinal direction calculus,
and a coarser version of Freksa's relative orientation calculus. An original
constraint propagation procedure is presented, which implements the interaction
between the ... | computer science |
18,082 | A ternary Relation Algebra of directed lines | cs.AI | We define a ternary Relation Algebra (RA) of relative position relations on
two-dimensional directed lines (d-lines for short). A d-line has two degrees of
freedom (DFs): a rotational DF (RDF), and a translational DF (TDF). The
representation of the RDF of a d-line will be handled by an RA of 2D
orientations, CYC_t, kn... | computer science |
18,083 | From Statistical Knowledge Bases to Degrees of Belief | cs.AI | An intelligent agent will often be uncertain about various properties of its
environment, and when acting in that environment it will frequently need to
quantify its uncertainty. For example, if the agent wishes to employ the
expected-utility paradigm of decision theory to guide its actions, it will need
to assign degr... | computer science |
18,084 | An Alternative to RDF-Based Languages for the Representation and
Processing of Ontologies in the Semantic Web | cs.AI | This paper describes an approach to the representation and processing of
ontologies in the Semantic Web, based on the ICMAUS theory of computation and
AI. This approach has strengths that complement those of languages based on the
Resource Description Framework (RDF) such as RDF Schema and DAML+OIL. The main
benefits o... | computer science |
18,085 | Quantifying and Visualizing Attribute Interactions | cs.AI | Interactions are patterns between several attributes in data that cannot be
inferred from any subset of these attributes. While mutual information is a
well-established approach to evaluating the interactions between two
attributes, we surveyed its generalizations as to quantify interactions between
several attributes.... | computer science |
18,086 | Evidential Force Aggregation | cs.AI | In this paper we develop an evidential force aggregation method intended for
classification of evidential intelligence into recognized force structures. We
assume that the intelligence has already been partitioned into clusters and use
the classification method individually in each cluster. The classification is
based ... | computer science |
18,087 | Application of Kullback-Leibler Metric to Speech Recognition | cs.AI | Article discusses the application of Kullback-Leibler divergence to the
recognition of speech signals and suggests three algorithms implementing this
divergence criterion: correlation algorithm, spectral algorithm and filter
algorithm. Discussion covers an approach to the problem of speech variability
and is illustrate... | computer science |
18,088 | The Algebra of Utility Inference | cs.AI | Richard Cox [1] set the axiomatic foundations of probable inference and the
algebra of propositions. He showed that consistency within these axioms
requires certain rules for updating belief. In this paper we use the analogy
between probability and utility introduced in [2] to propose an axiomatic
foundation for utilit... | computer science |
18,089 | An information theory for preferences | cs.AI | Recent literature in the last Maximum Entropy workshop introduced an analogy
between cumulative probability distributions and normalized utility functions.
Based on this analogy, a utility density function can de defined as the
derivative of a normalized utility function. A utility density function is
non-negative and ... | computer science |
18,090 | Abductive Logic Programs with Penalization: Semantics, Complexity and
Implementation | cs.AI | Abduction, first proposed in the setting of classical logics, has been
studied with growing interest in the logic programming area during the last
years.
In this paper we study abduction with penalization in the logic programming
framework. This form of abductive reasoning, which has not been previously
analyzed in l... | computer science |
18,091 | Local-search techniques for propositional logic extended with
cardinality constraints | cs.AI | We study local-search satisfiability solvers for propositional logic extended
with cardinality atoms, that is, expressions that provide explicit ways to
model constraints on cardinalities of sets. Adding cardinality atoms to the
language of propositional logic facilitates modeling search problems and often
results in c... | computer science |
18,092 | WSAT(cc) - a fast local-search ASP solver | cs.AI | We describe WSAT(cc), a local-search solver for computing models of theories
in the language of propositional logic extended by cardinality atoms. WSAT(cc)
is a processing back-end for the logic PS+, a recently proposed formalism for
answer-set programming. | computer science |
18,093 | Utility-Probability Duality | cs.AI | This paper presents duality between probability distributions and utility
functions. | computer science |
18,094 | Parametric Connectives in Disjunctive Logic Programming | cs.AI | Disjunctive Logic Programming (\DLP) is an advanced formalism for Knowledge
Representation and Reasoning (KRR). \DLP is very expressive in a precise
mathematical sense: it allows to express every property of finite structures
that is decidable in the complexity class $\SigmaP{2}$ ($\NP^{\NP}$).
Importantly, the \DLP en... | computer science |
18,095 | Logic-Based Specification Languages for Intelligent Software Agents | cs.AI | The research field of Agent-Oriented Software Engineering (AOSE) aims to find
abstractions, languages, methodologies and toolkits for modeling, verifying,
validating and prototyping complex applications conceptualized as Multiagent
Systems (MASs). A very lively research sub-field studies how formal methods can
be used ... | computer science |
18,096 | Great Expectations. Part I: On the Customizability of Generalized
Expected Utility | cs.AI | We propose a generalization of expected utility that we call generalized EU
(GEU), where a decision maker's beliefs are represented by plausibility
measures, and the decision maker's tastes are represented by general (i.e.,not
necessarily real-valued) utility functions. We show that every agent,
``rational'' or not, ca... | computer science |
18,097 | Great Expectations. Part II: Generalized Expected Utility as a Universal
Decision Rule | cs.AI | Many different rules for decision making have been introduced in the
literature. We show that a notion of generalized expected utility proposed in
Part I of this paper is a universal decision rule, in the sense that it can
represent essentially all other decision rules. | computer science |
18,098 | Unsupervised Grammar Induction in a Framework of Information Compression
by Multiple Alignment, Unification and Search | cs.AI | This paper describes a novel approach to grammar induction that has been
developed within a framework designed to integrate learning with other aspects
of computing, AI, mathematics and logic. This framework, called "information
compression by multiple alignment, unification and search" (ICMAUS), is founded
on principl... | computer science |
18,099 | Integrating existing cone-shaped and projection-based cardinal direction
relations and a TCSP-like decidable generalisation | cs.AI | We consider the integration of existing cone-shaped and projection-based
calculi of cardinal direction relations, well-known in QSR. The more general,
integrating language we consider is based on convex constraints of the
qualitative form $r(x,y)$, $r$ being a cone-shaped or projection-based cardinal
direction atomic r... | computer science |
18,100 | Modeling Object Oriented Constraint Programs in Z | cs.AI | Object oriented constraint programs (OOCPs) emerge as a leading evolution of
constraint programming and artificial intelligence, first applied to a range of
industrial applications called configuration problems. The rich variety of
technical approaches to solving configuration problems (CLP(FD), CC(FD), DCSP,
Terminolo... | computer science |
18,101 | Diagnostic reasoning with A-Prolog | cs.AI | In this paper we suggest an architecture for a software agent which operates
a physical device and is capable of making observations and of testing and
repairing the device's components. We present simplified definitions of the
notions of symptom, candidate diagnosis, and diagnosis which are based on the
theory of acti... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.