The language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a sim...
详细信息
ISBN:
(纸本)354020721X
The language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a simple translation into the language of logic programs under the answer set semantics is available. In this paper we define a similar translation for causal theories of a more general form, called almost definite. Such theories can be used, for instance, to characterize the transitive closure of a binary relation. The new translation leads to an implementation of a subclass of almost definite causal theories that employs the answer set solver SMODELS as the search engine.
The use of fuzzy quantifiers in linguistic fuzzy models helps to build fuzzy systems that use linguistic terms in a more natural way. Although several fuzzy quantification techniques have been developed, the applicati...
详细信息
ISBN:
(纸本)0780383532
The use of fuzzy quantifiers in linguistic fuzzy models helps to build fuzzy systems that use linguistic terms in a more natural way. Although several fuzzy quantification techniques have been developed, the application of the existing techniques seems very limited. This paper proposes an application of fuzzy quantification to replace crisp weights in subsethood-based fuzzy rule models. In addition to the concern that fuzzy models should have high accuracy rate, attention has also been taken to maintain the simplicity of the generated fuzzy model. The objective is to produce quantifier-based fuzzy models which are not only readable but also practically applicable. The quantifier based fuzzy model is then applied to classification tasks. The classification accuracies of fuzzy models that use crisp weights, continuous quantifiers, multi-valued quantifiers and two-valued quantifiers are compared. Experimental results show that the classification accuracy of the fuzzy model that uses continuous quantifiers is: 1) as good as the classification accuracy of the fuzzy models that use crisp weights, and 2) in most cases, better than fuzzy models that use multi-valued quantifiers or two-valued quantifiers.
The stable model semantics of disjunctive logic programs is based on classical models which are minimal with respect to subset inclusion. As a consequence, every atom appearing in a disjunctive program is false by def...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
The stable model semantics of disjunctive logic programs is based on classical models which are minimal with respect to subset inclusion. As a consequence, every atom appearing in a disjunctive program is false by default. This is sometimes undesirable from the knowledge representation point of view and a more refined control of minimization is called for. Such features are already present in Lifschitz's parallel circumscription where certain atoms are allowed to vary or to have fixed values while all other atoms are minimized. In this paper, it is formally shown that the expressive power of minimal models is properly increased in the presence of varying atoms. In spite of this, we show how parallel circumscription can be embedded into disjunctive logic programming in a relatively systematic fashion using a linear and faithful, but non-modular translation. This enables the conscious use of varying atoms in disjunctive logic programs leading to more elegant and concise problem representations in various domains.
We give an overview of some current variable elimination techniques in constraint solving and their applications. We focus on numerical constraints, with variables ranging over the reals, the integers, or the p-adics,...
详细信息
ISBN:
(纸本)3540223452
We give an overview of some current variable elimination techniques in constraint solving and their applications. We focus on numerical constraints, with variables ranging over the reals, the integers, or the p-adics, but include also constraints of a more combinatorial nature, with Boolean variables of variables in free term structures.
LPEQ and DLPEQ, two translators for automated equivalence testing of logic programs are discussed. The translators LPEQ and DLPEQ have been implemented in the C programming language under the Linux operating system. B...
详细信息
ISBN:
(纸本)354020721X
LPEQ and DLPEQ, two translators for automated equivalence testing of logic programs are discussed. The translators LPEQ and DLPEQ have been implemented in the C programming language under the Linux operating system. Both translators take two logic programs and command line options as their input and produce a translation for equivalence testing as their output. The input files are assumed to be in an internal format, as produced by the front-end LPARSE of the SMODELS system.
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 propos...
详细信息
ISBN:
(纸本)354020721X
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.
A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented. The main contribution is a new sufficient condition which guarantees termination of all q...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several extensions of these conditions are presented and related to some well-known formalisms for probabilistic logic programming.
Qsmodels is a novel application of Answer Set programming to interactive gaming environment. We describe a software architecture by which the behavior of a bot acting inside the Quake 3 Arena can be controlled by a pl...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
Qsmodels is a novel application of Answer Set programming to interactive gaming environment. We describe a software architecture by which the behavior of a bot acting inside the Quake 3 Arena can be controlled by a planner. The planner is written as an Answer Set Program and is interpreted by the Smodels solver.
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space would definitely be undesirable if it can...
详细信息
暂无评论