Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

rss_1.0 Clasificación por Disciplina

Nomenclatura Unesco > (11) Lógica

Mostrando recursos 81 - 100 de 6,042

81. An interactive semantics of logic programming - Bruni, Roberto; Montanari, Ugo; Rossi, Francesca
The semantic framework we have chosen for presenting our results is tile logic, which has the advantage of allowing a uniform treatment of goals and observations and of applying abstract categorical tools for proving the results.

82. Logic programs with monotone cardinality atoms - Marek, Victor W.; Niemela, Ilkka; Truszczynski, Miroslaw
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of propositional atoms.

83. Logic Column 18: Alternative Logics: A Book Review - Pucella, Riccardo
This article discusses two books on the topic of alternative logics in science: "Deviant Logic", by Susan Haack, and "Alternative Logics: Do Sciences Need Them?", edited by Paul Weingartner.

84. The logic of interactive Turing reduction - Japaridze, Giorgi
This concept -- more precisely, the associated concept of reducibility -- is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity.

85. Logic Programming with Default, Weak and Strict Negations - Yamasaki, Susumu
This paper treats logic programming with three kinds of negation: default, weak and strict negations.

86. A note on the Declarative reading(s) of Logic Programming - Denecker, Marc
This paper analyses the declarative readings of logic programming.

87. Temporal Runtime Verification using Monadic Difference Logic - Andersen, Henrik Reif; Kristoffersen, Kaare J.
First, the bounded temporal formula to be verified is translated into a monadic first-order logic over difference inequalities, which we call monadic difference logic.

88. Temporal Phylogenetic Networks and Logic Programming - Erdem, Esra; Lifschitz, Vladimir; Ringe, Don
The concept of a temporal phylogenetic network is a mathematical model of evolution of a family of natural languages.

89. On the Expressiveness of the Ambient Logic - Hirschkoff, Daniel; Lozes, Etienne; Sangiorgi, Davide
In this paper, we study the expressiveness of AL.

90. The logic of ontic and epistemic change - van Ditmarsch, H. P.; Kooi, B. P.
We propose an epistemic logic incorporating dynamic operators to describe information changing events, both informative actions, where agents become more informed about the non-changing state of the world, as ontic changes, wherein the world and the facts describing it change themselves as well.

91. Abduction with Penalization in Logic Programming - Ianni, Giovambattista; Leone, Nicola; Perri, Simona; Scarcello, Francesco
This form of abductive reasoning, which has not been previously analyzed in logic programming, turns out to represent several relevant problems, including optimization problems, very naturally.

92. The prospects for mathematical logic in the twenty-first century - Buss, Samuel R.; Kechris, Alexander S.; Pillay, Anand; Shore, Richard A.
The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

93. Static Analysis Techniques for Equational Logic Programming - Verma, Rakesh M.
We present static analysis techniques for efficient equational logic programming, some of which have been implemented in $LR^2$, a laboratory for developing and evaluating fast, efficient, and practical rewriting techniques.

94. Arithmetic, First-Order Logic, and Counting Quantifiers - Schweikardt, Nicole
This paper gives a thorough overview of what is known about first-order logic with counting quantifiers and with arithmetic predicates.

95. Preferred Answer Sets for Ordered Logic Programs - Van Nieuwenborgh, Davy; Vermeir, Dirk
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a ``best'' answer set.

96. Processor Verification Using Efficient Reductions of the Logic of Uninterpreted Functions to Propositional Logic - Bryant, Randal E.; German, Steven; Velev, Miroslav N.
By reducing formulas in this logic to propositional formulas, we can apply Boolean methods such as Ordered Binary Decision Diagrams (BDDs) and Boolean satisfiability checkers to perform the verification.

97. A Theory of Computation Based on Quantum Logic (I) - Ying, Mingsheng
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic.

98. First-order Logic as a Constraint Programming Language - Apt, K. R.; Vermeulen, C. F. M.
We provide a denotational semantics for first-order logic that captures the two-level view of the computation process typical for constraint programming.

99. Introduction to linear logic and ludics, part II - Curien, Pierre-Louis
This paper is the second part of an introduction to linear logic and ludics, both due to Girard.

100. Logic Column 11: The Finite and the Infinite in Temporal Logic - Pucella, Riccardo
This article examines the interpretation of the LTL temporal operators over finite and infinite sequences.

Página de resultados:
Anterior  1  2  3  4  5  6  7  8  9  10  11  12  13  14  Siguiente