Results 91 to 100 of about 567,077 (336)
Logical foundations and implementation of an extension of temporal logic
Journal of Computer Science and Technology, 2000 The need of counting with the appropiate management of situations involving time an the motion of change, has been reconized as an important aspect in many Computer Science areas.
María Laura Cobo, Juan Carlos Augusto
doaj
IMP with exceptions over decorated logic [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with “decorations”that describe what computational (side) effect evaluation of a term may involve.
Burak Ekici
doaj +1 more source
Inductive Logic Programming [PDF]
, 2011 Inductive logic programming is the subfield of machine learning that uses first order logic to represent hypotheses and data. Because first order logic is expressive and declarative, inductive logic programming specfically targets problems involving structured data and background knowledge. Inductive logic programming tackles a wide variety of problems
openaire +3 more sources
Program Logic Foundations: Putting the Logic Back into Program Logic
Journal of MultiDisciplinary Evaluation, 2020 Background: Program logic is one of the most used tools by the public policy evaluator. There is, however, little explanation in the evaluation literature about the logical foundations of program logic or discussion of how it may be determined if a program is logical.
openaire +2 more sources
Theory and Practice of Logic Programming, 2003 To appear in Special Issue of the Theory and Practice of Logic Programming Journal on Answer Set Programming ...
Vladimir Lifschitz, Esra Erdem
openaire +3 more sources
Advanced Functional Materials, EarlyView.Herein, the synthesis of Ta₂Pd₃S₈ nanowires is reported via scalable liquid cascade exfoliation and their integration into high‐mobility field‐effect transistors (FETs) and sensitive photodetectors, achieving carrier mobility of up to 27.3 cm2 V⁻¹ s⁻¹ and responsivities of 322.40 A W⁻¹ and 1.85 mA W⁻¹ for single nanowire and network devices ...
Kyung Hwan Choi +13 more
wiley +1 more source
Characterization of Strongly Equivalent Logic Programs in Intermediate Logics [PDF]
arXiv, 2002 The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of 'strong equivalence' between logical programs that can be verified in 3-valued Goedel logic, G3, the strongest non-classical intermediate propositional logic (Lifschitz, Pearce and Valverde, 2001). In this paper
arxiv
Tractable reasoning about Agent Programming in Dynamic Preference Logic [PDF]
, 2019 While several BDI logics have been proposed in the area of Agent Programming, it is not clear how these logics are connected to the agent programs they are supposed to specify. More yet, the reasoning problems in these logics, being based on modal logic, are not tractable in general, limiting their usage to tackle real-world problems.
arxiv +1 more source
DEDUCŢIA LOGICĂ – MECANISM DE CALCUL AL LIMBAJULUI DE PROGRAMARE LOGICĂ
Studia Universitatis Moldaviae: Stiinte Umanistice, 2008 The present article focuses on analysis and synthesis of elements which are the base of abstract interpreter of programs written in logic. Logic programming and Prolog language significance in studying computer science is appreciating.
USM ADMIN
doaj
Towards Interactive Logic Programming [PDF]
, 2015 Linear logic programming uses provability as the basis for computation. In the operational semantics based on provability, executing the additive-conjunctive goal $G_1 \& G_2$ from a program $P$ simply terminates with a success if both $G_1$ and $G_2 ...
Kwon, Keehang, Park, Mi-Young
core