http://biblioteca.universia.net/vernivel.do?start=340&nivel=11 Mostrando recursos 341 - 360 de 88,632 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=47166207 Abstract. In this paper it is argued that Hintikka’s game theoretical semantics for Independence Friendly logic does not formalize the intuitions about independent choices; it rather is a formalization of imperfect information. Furthermore it is shown that the logic has several strange properties. An alternative semantics is proposed which formalizes intuitions about independence. Theo M. V. Janssen http://biblioteca.universia.net/ficha.do?id=45690473 Abstract. In this paper it is argued that Hintikka’s game theoretical semantics for Independence Friendly logic does not formalize the intuitions about independent choices; it rather is a formalization of imperfect information. Furthermore it is shown that the logic has several strange properties (e.g. renaming of bound variables is not allowed). An alternative semantics is proposed which formalizes intuitions about independence. Theo M. V. Janssen http://biblioteca.universia.net/ficha.do?id=45701869 Abstract. Nonmonotonic reasoning is succesfully formalized by the class of default logics. In this paper we introduce an axiomatic system for credulous reasoning in rational default logic. Based on classical sequent calculus and anti-sequent calculus, an abstract characterization of credulous nonmonotonic default inference in this variant of default logic is presented. Mihaiela Lupea http://biblioteca.universia.net/ficha.do?id=41519540 this paper, however, that the techniques of nonmonotonic logic may provide a better theoretical framework---at least for the formalization of commonsense normative reasoning---than the usual modal treatment. After reviewing some standard approaches to deontic logic, I focus on two areas in which nonmonotonic techniques promise improved understanding: reasoning in the presence of conflicting obligations, and reasoning with conditional obligations. 2 Modal techniques in deontic logic John F. Horty http://biblioteca.universia.net/ficha.do?id=41648956 this paper, however, that the techniques of nonmonotonic logic may provide a better theoretical framework---at least for the formalization of commonsense normative reasoning---than the usual modal treatment. After reviewing some standard approaches to deontic logic, I focus on two areas in which nonmonotonic techniques promise improved understanding: reasoning in the presence of conflicting obligations, and reasoning with conditional obligations. 2 Modal techniques in deontic logic John F. Horty http://biblioteca.universia.net/ficha.do?id=46450454 The design of linear logic programming languages and theorem provers opens a number of new implementation challenges not present in more traditional logic languages such as Horn clauses (Prolog) and hereditary Harrop formulas (Prolog and Elf ). Among these, the problem of eciently managing the linear context when solving a goal is of crucial importance for the use of these systems in non-trivial applications. This paper studies this problem in the case of Lolli [10], though its results have a... Iliano Cervesato; Joshua S. Hodas; Frank Pfenning http://biblioteca.universia.net/ficha.do?id=46455981 This work compares and analyses conventional and logic programming systems using a qualitative and quantitative approach. Logic programming is known to be easier and simpler than imperative programming, but it is not very popular because of its believed inefficiency. Our work shows that logic programming can be as efficient as imperative programming for a wide range of symbolic and scientific applications. We used different Prolog-based systems, including SICStus, XSB, Yap, CLP(R) and Aurora ... Vanusa Menditi Calegario; Inês de Castro Dutra http://biblioteca.universia.net/ficha.do?id=46467931 In this paper we propose a method for proving termination of logic programs with delay declarations. The method is based on the notion of recurrent logic program, which is used to prove programs terminating with respect to an arbitrary selection rule. Most importantly, we use the notion of bound query (as proposed by M. Bezem) in the definition of cover , a new notion which forms the kernel of our approach. We introduce the class of delay recurrent programs and prove that programs in thi... Elena Marchiori And; E. Marchiori; F. Teusink; Issn -x; Mathematisch Centrum (smc; The Dutch Foundation; Elena Marchiori; Frank Teusink http://biblioteca.universia.net/ficha.do?id=46492852 . In this paper we study constructions leading to the formation of belief sets by agents. We focus on the situation when possible belief sets are built incrementally in stages. We call an infinite sequence of theories that represents such a process a reasoning trace. A set of reasoning traces describing all possible reasoning scenarios for the agent is called a reasoning frame. Default logic by Reiter is not powerful enough to represent reasoning frames. In the paper we introduce a gene... Joeri Engelfriet Wiktor; V. Wiktor Marek http://biblioteca.universia.net/ficha.do?id=47270836 Abstract. We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation. Our logic supports verification of hybrid programs with first-order definable flows and provides a uniform treatment of discrete and continuous evolution. For our combined logic, we generalise the semantics of dynamic modalities to refer to hybrid traces instead of final states. Further, we prove that thi... André Platzer http://biblioteca.universia.net/ficha.do?id=46387971 We give a short proof-theoretic treatment of a terminating contraction-free calculus G4-LC for the zero-order Godel-Dummett logic LC. This calculus is a slight variant of a calculus given by Avellone et al, who show its completeness by model-theoretic techniques. In our calculus, all the rules of G4-LC are invertible, thus allowing a deterministic proof-search procedure. Keywords: sequent calculus, contraction-free, terminating, Godel-Dummett logic 1 Introduction In previous work [9] the a... Roy Dyckhoff; Godel-dummett Logic http://biblioteca.universia.net/ficha.do?id=46143716 The concept of homogeneous multi-adjoint logic program is introduced, and a procedure to homogenize an arbitrary multi-adjoint logic program is presented. The procedure is proved to preserve models and, moreover, some complexity results are given. Jesus Medina; Manuel Ojeda-Aciego http://biblioteca.universia.net/ficha.do?id=41520574 This paper is organized as follows : Section 2 pursues the overview by introducing background material on fuzzy set and possibility theory, including comparative possibility relations that underlie possibility and necessity measures. Section 3 forms the main body of the paper and presents formal aspects of a fragment of possibilistic logic where formulas are valued by a lower bound on their degree of necessity. It includes an axiomatization and a refutation method based on extended resolution... Didier Dubois,Henri Prade http://biblioteca.universia.net/ficha.do?id=42394990 Traditional statistical methods for seismic zonation require information from many subjects, such as regional geology and neotectonics, seismicity, stress field, damage analysis of historic earthquakes, geophysics and others. These subjects are weighted differently during statistics. In fact, the information from most of these subjects is more like fuzzy sets, ie, it is a sort of estimation rather than precise data. In this paper we propose a fuzzy logic system that uses crustal structural fe... Guo, Wanwu. http://biblioteca.universia.net/ficha.do?id=45396715 Traditional statistical methods for seismic zonation require information from many subjects, such as regional geology and neotectonics, seismicity, stress field, damage analysis of historic earthquakes, geophysics and others. These subjects are weighted differently during statistics. In fact, the information from most of these subjects is more like fuzzy sets, ie, it is a sort of estimation rather than precise data. In this paper we propose a fuzzy logic system that uses crustal structural fe... Guo, Wanwu. http://biblioteca.universia.net/ficha.do?id=45729051 Abstract. We introduce a new decision procedure for Equality Logic. The procedure improves on Bryant and Velev’s sparse method [4] from CAV’00, in which each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality. We suggest the Reduced Transitivity Constraints (rtc) algorithm, that unlike the sparse method, considers the polarity of each equality predicate, i.e. whether it is an equali... Orly Meir; Ofer Strichman http://biblioteca.universia.net/ficha.do?id=41477358 er logic can still be adequate programming languages. Mathematicians have used first order logic as a programming language in which to encode all the known acceptable principles of mathematical inference. The result is axiomatic set theory. Any mathematical proof can, in principle, be expressed as a proof in first order set theory. In this sense axiomatic set theory is an adequate foundation for mathematics. However, it is known that these principles of inference are not complete, e.g., there... http://biblioteca.universia.net/ficha.do?id=41603937 interpretation is a language-independent theory for static analysis of programs. This theory plays a prominent role in much work in the group, since most sophisticated implementation ideas require static analysis. The work contributes to the theory generally, as well as its applications in functional and logic programming, including sophisticated program transformation. Techniques are also being developed to dramatically reduce the time and effort spent on debugging. Traditional debugging tec... http://biblioteca.universia.net/ficha.do?id=41714735 first order logic can still be adequate programming languages. Mathematicians have used first order logic as a programming language in which to encode all the known acceptable principles of mathematical inference. The result is axiomatic set theory. Any mathematical proof can, in principle, be expressed as a proof in first order set theory. In this sense axiomatic set theory is an adequate foundation for mathematics. However, 1 it is known that these principles of inference are not complete, ... http://biblioteca.universia.net/ficha.do?id=41860339 interpretation is a language-independent theory for static analysis of programs. This theory plays a prominent role in much work in the group, since most sophisticated implementation ideas require static analysis. The work contributes to the theory generally, as well as its applications in functional and logic programming, including sophisticated program transformation. Techniques are also being developed to dramatically reduce the time and effort spent on debugging. Traditional debugging tec...