141.
Extension of WAM for a linear-logic-based logic programming language
- Yukio Kaneda; Naoyuki Tamura; Naoyuki Tamura
This paper describes an extension of WAM instruction set for a logic programming language called LLP which is based on intuitionisic linear logic. LLP includes additive and multiplicative conjunction, linear implication in a goal, exponential (!) for atomic resource formula, and the constant 1. The extension of WAM is mainly for efficient resource management: especially for resource look-up and deletion. In our design, only one table is maintained to keep resources during the execution. Looking-up of a resource is done through a symbol table or a hash table. Deletion of a resource is done by just "marking" the entry in...
142.
Paraconsistent Deontic Logic with Enforceable Rights
- Peña, Lorenzo; Ausín, Txetxu
En: Frontiers of Paraconsistent Logic
ed. por D. Batens, Ch. Mortensen, G. Priest & J.-P. van Bendegem
Baldford (England): Research Studies Press Ltd.
(RSP) [Logic and Computation Series], 2000. ISBN 086302532, pp. 29-47
143.
Tableaux e indução na lógica do plausível
- Luiz Henrique da Cruz Silvestrini
Em 1999, Grácio introduziu a Lógica do Plausível como uma particularização de uma família de sistemas lógicos, caracterizados pela inclusão de um quantificador generalizado na sintaxe da lógica clássica de predicados, a saber, as Lógicas Moduladas, cuja formalização semântica é dada por um subconjunto do conjunto das partes do universo. Nesta particularização de lógica modulada, é incluído o quantificador do Plausível P, que engendra a formalização de um raciocínio indutivo de maneira que uma boa parte dos indivíduos possui determinada propriedade. O presente trabalho introduz um novo sistema dedutivo para a Lógica do Plausível, denominado TLP, construído seguindo os princípios...
144.
Logic-Motivated Choice of Fuzzy Logic Operators
Many different "and"- and
"or"-operations have been proposed for use in fuzzy
logic; ; see, e.g., [4], [13]. It is therefore important
to select, for each particular application, the operations
which are the best for this particular application.
Several papers discuss the optimal choice of
"and"- and "or"-operations for fuzzy control, when
the main criterion is to get the stablest control (or
the smoothest or the most robust or the fastest-tocompute)
. In reasoning applications, however, it is
more appropriate to select operations which are the
best in reflecting human reasoning, i.e., operations
which are "the most logical". In this paper, we explain
how we can use logic motivations to select fuzzy
logic operations,...
145.
Derivation of logic programs by functional methods
- A. Bijlsma
In this note we present a method for the calculational derivation of logic programs, employing techniques recently developed for the derivation of functional programs. It has been proposed [10] that the process of synthesizing logic programs should begin with a specification that is itself a (possibly inefficient) logic program; subsequently transformations
146.
(University of Microfilm International)
- Neutrosophic Logic; Neutrosophic Set; Neutrosophic Probability
editor
147.
Game Logic for Game Theorists
- M. Pauly; Marc Pauly
Game Logic (GL), introduced in [18], is examined from a game-theoretic perspective. A new semantics for GL is proposed in terms of untyped games which are closely related to extensive game forms of perfect information. An example is given of how GL can be used as a formal model of game situations, and some metatheoretic results are presented in the context of their game-theoretic relevance. 2000 Mathematics Subject Classification: 03B99, 91A10, 91A40 1998 ACM Computing Classification System: F.3.0, F.4.1 Keywords and Phrases: Dynamic Logic, Game Theory, Semantics Note: Work carried out in the cluster INS "Information Systems". 1. Introduction Over...
148.
Default Logic as a Query Language
- Marco Cadoli; Thomas Eiter; Georg Gottlob
| Research in non-monotonic reasoning has focused largely on the idea of representing knowledge about the world via rules that are generally true but can be defeated. Even if relational databases are nowadays the main tool for storing very large sets of data, the approach of using non-monotonic AI formalisms as relational database query languages has been investigated to a much smaller extent. In this work we propose a novel application of Reiter's default logic by introducing a default query language (DQL) for nite relational databases, which is based on default rules. The main result of this paper is that...
149.
Inference in conditional probability logic
- Niki Pfeifer; Gernot D. Kleiter
An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form “if..., then... ” by conditional probabilities and not by the probability of the material implication. An inference rule is probabilistically informative if the coherent probability interval of its conclusion is not necessarily equal to the unit interval [0, 1]. Not all logically valid inference rules are probabilistically informative and vice versa. The relationship between logically valid and probabilistically informative inference rules is discussed...
150.
Representation Theory for Default Logic
- V. Wiktor; Marek Jan Treur
Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of extensions of a default theory. We give a complete solution to the representability by means of normal default theories. We obtain partial results on representability by arbitrary default theories. In particular, we construct examples of denumerable families of nonincluding theories that are not representable. We also study the concept of equivalence between default theories. We show that for...
151.
Intuitionistic Completeness and Classical Logic
- McCarty, D. C.
We show that, if a suitable intuitionistic metatheory proves that consistency implies satisfiability for subfinite sets of propositional formulas relative either to standard structures or to Kripke models, then that metatheory also proves every negative instance of every classical propositional tautology. Since reasonable intuitionistic set theories such as HAS or IZF do not demonstrate all such negative instances, these theories cannot prove completeness for intuitionistic propositional logic in the present sense.
152.
Le Fun: Logic, equations, and Functions
- Patrick Lincoln; Roger Nasr
Abstract # We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research,our approach is not based on extending unification to general-purpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a clear distinction between functional evaluation andlogical deduction. The former is based on the *-calculus, and the latter on Horn clause resolution. In clear contrastwith equation-solving approaches, our model supports higher-order function evaluation and efficient compilation of
153.
Bounded Nondeterminism of Logic Programs
- Dino Pedreschi; Salvatore Ruggieri
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for them via any selection rule. We o#er a declarative characterization of the class of programs and queries that have bounded nondeterminism by defining bounded programs and queries. The characterization is provided in terms of Herbrand interpretations and level mappings, in the style of existing characterizations of universal termination.
154.
SLWV- A Logic Programing Theorem Prover
- Luis Moniz Pereira; Luis Caires; José Alferes; Ai Centre Uninova
Abstract: The purpose of this work is to define a theorem prover that retains the procedural aspects of logic programing. The proof system we propose (SLWV 1 resolution) is defined for a set of clauses in the implicational form (keeping to the form of logic programs), not requiring contrapositives, and has an execution method that respects the execution order of literals in a clause, preserving the procedural flavor of logic programming. SLWV resolution can be seen as a combination of SL-resolution [Chan73] and case-analysis, that admits a form of linear derivation. We prove its soundness and completeness, give it an...
155.
Two results for prioritized logic programming
- Zhang, Yan, 1962-
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 of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized...
156.
Two results for prioritized logic programming
- Zhang, Yan, 1962-
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 of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized...
157.
Iterate Logic
- Peter H. Schmitt
We introduce a new logic for nite rst-order structures with
a linear odering. We study its expressive power. In particular we show
that it is strictly stronger than rst-order logic on nite structures. We
close with a list of open problems.
1
158.
A teoria da lógica mental: e os estudos empíricos em crianças e adultos
- Dias,Maria da Graça Bompastor Borges; Roazzi,Antonio
Discorremos sobre a teoria da lógica mental como hoje se apresenta, as controvérsias oriundas dos estudos que utilizam a Tabela de Verdade da Lógica Padrão e os estudos empíricos com crianças e adultos que dão suporte à lógica proposicional e à lógica predicativa.
159.
Extensionality of Simply Typed Logic Programs
- Marc A. Bezem; Marc Bezem
We set up a framework for the study of extensionality in the context of higher-order logic programming. For simply typed logic programs we propose a novel declarative semantics, consisting of a model class with a semicomputable initial model, and a notion of extensionality. We show that the initial model of a simply typed logic program, in case the program is extensional, collapses into a simple, set-theoretic representation. Given the undecidability of extensionality in general, we develop a decidable, syntactic criterion which is su#cient for extensionality. Some typical examples of higher-order logic programs are shown to be extensional. 1991 Mathematics Subject...
160.
WoLLIC 2005 Preliminary Version Propositional Logic as a Propositional Fuzzy Logic
- Benjamín René; Callejas Bedregal; Anderson Paiva Cruz
There are several ways to extend the classical logical connectives for fuzzy truth degrees, in such a way that their behavior for the values 0 and 1 work exactly as in the classical one. For each extension of logical connectives the formulas which are always true (the tautologies) changes. In this paper we will provide a fuzzy interpretation for the usual connectives (conjunction, disjunction, negation, implication and bi-implication) such that the set of tautologies is exactly the set of classical tautologies. Thus, when we see logics as set of formulas, then the propositional (classical) logic has a fuzzy model.
