Filters








107,590 Hits in 4.1 sec

Matching mu-Logic: Foundation of K Framework (Invited Paper)

Xiaohong Chen, Grigore Rosu, Michael Wagner
2019 Conference on Algebra and Coalgebra in Computer Science  
In this extended abstract, we present matching µ-logic as the foundation of K and discuss some of its applications in defining constructors, transition systems, modal µ-logic and temporal logic variants  ...  ACM Subject Classification Theory of computation → Logic  ...  The semantics of ϕ ⇒ ϕ is that for every configuration γ that matches ϕ, either it reaches some configuration γ that matches ϕ in finitely many steps, or it is not well-founded.  ... 
doi:10.4230/lipics.calco.2019.1 dblp:conf/calco/0002R19 fatcat:vkyvq4ybm5cr5c3qgnmah2z2jy

Page 5360 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
This seminal work provides a constructive characterization of the well-founded models of Van Gelder, Ross, and Schlift, whose well- founded semantics is arguably the most successful of the several extant  ...  The construction involves a reformulation of Gel- fond and Lifschitz’s stability transformation which plays a critical role in their stable model semantics, the chief “competitor” to the well-founded semantics  ... 

Evolving Reactive Logic Programs

José Júlio Alferes, Federico Banti, Antonio Brogi
2008 Festschrifts: Birthday, In Memory of ...  
to strengthening the semantics foundations of dynamic logic programs, we describe a simple formalism to reason about actions -based on dynamic logic programsand its recent event-condition-action extension  ...  that supports the specification and the execution of reactive programs.  ...  In this paper, we first review (Section 2) our contribu-tions to strengthening the semantics foundations of dynamic logic programs that yielded a refined stable-model based semantics and a well-founded  ... 
dblp:conf/birthday/AlferesBB08 fatcat:4xqlyqb2pjewdmtos7mq3mramq

Contextual hypotheses and semantics of logic programs [article]

Éric A. Martin
2011 arXiv   pre-print
The field has seen the advent of a number of alternative semantics, with Kripke-Kleene semantics, the well-founded semantics, the stable model semantics, and the answer-set semantics standing out as the  ...  Our approach offers a unified view on the various semantics proposed in logic programming, classical in that only classical negation is used, and links the semantics of logic programs to mechanisms that  ...  related to the well founded semantics.  ... 
arXiv:0901.0733v2 fatcat:g47rdxwdl5fjhemeifassdclqa

Editorial

Hélène Kirchner, Wolfgang Wechler
1992 Theoretical Computer Science  
In the first case, strong completion specifies stable semantics, and in the second case, well-founded semantics.  ...  This approach provides a sound and complete query-answering system with respect to the well-founded semantics of a class of programs characterized here.  ... 
doi:10.1016/0304-3975(92)90283-l fatcat:nb6jl2blyrfg3pkdq6yrch5wwi

Page 431 of Mathematical Reviews Vol. , Issue 95a [page]

1995 Mathematical Reviews  
Relationships between the well-founded semantics of logic programs and autoepistemic logics are established as well.  ...  The authors introduce the expansion class semantics for these logics, and then they show that the weak well-founded semantics is equivalent to the unique <, minimal strict iterative expansion class.  ... 

Answer Set Solving in Practice

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub
2012 Synthesis Lectures on Artificial Intelligence and Machine Learning  
logics, Circumscription '90 Amalgamation and computation Logic programming semantics Well-founded and stable models semantics ASP solving "Stable models = Well-founded semantics + Branch" '00  ...  Well-founded and stable models semantics ASP solving "Stable models = Well-founded semantics + Branch" '00 Applications and semantic rediscoveries Growing dissemination Decision Support for Space  ... 
doi:10.2200/s00457ed1v01y201211aim019 fatcat:6rjcnjjkqvdzdgyrjvzfnhluj4

Page 5012 of Mathematical Reviews Vol. , Issue 2001G [page]

2001 Mathematical Reviews  
This is a distinguished feature of the semantics considered since, for instance, negation-as-failure in the framework of well-founded semantics is proved to be not stable over any intermediate logic!  ...  Logic Comput. 1 (1990), no. 2, 159-185; MR 93a:68085], in the sense that it computes all partial models (well-founded and stable par- tial models included) instead of only ‘total’ models (a possibly empty  ... 

Page 4760 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
94h:68131 94h:68131 68Q55 68N17 Gire, Francoise (F-PARIS7-LI; Paris) Well founded semantics and stable semantics of semi-strict programs.  ...  Summary: “In this paper we exhibit a condition on the syntax of the logic programs with negation, the semistrictness property, which assures the equivalence of the well-founded semantics and the stable  ... 

Page 5870 of Mathematical Reviews Vol. , Issue 98I [page]

1998 Mathematical Reviews  
The paper is an important contribution to the study of rela- tionships between stable and well-founded semantics.  ...  Summary: “We present an approach to foundations of logic pro- gramming in which the connection with algebraic semantics be- comes apparent.  ... 

Department of Computer Science

1991 Journal of Computational and Applied Mathematics  
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs.  ...  Since for normal logic programs these models coincide with partial stable models, we propose the resulting partial equilibrium logic as a logical foundation for well-founded semantics.  ...  provides a foundation for and extension of well-founded inference.  ... 
doi:10.1016/s0377-0427(91)90073-s fatcat:is7milsu65bhjnqmhk7ei5nfbq

Department of Computer Science

1993 Journal of Computational and Applied Mathematics  
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs.  ...  Since for normal logic programs these models coincide with partial stable models, we propose the resulting partial equilibrium logic as a logical foundation for well-founded semantics.  ...  provides a foundation for and extension of well-founded inference.  ... 
doi:10.1016/0377-0427(93)90083-n fatcat:e3qojetr5re5rpb2alwd6g7ky4

Page 519 of Mathematical Reviews Vol. , Issue 2002A [page]

2002 Mathematical Reviews  
In particular, both of them extend the well- founded semantics of normal logic programs.  ...  While the semantics of non- disjunctive programs is fairly well understood, the declarative and computational foundations of disjunctive logic programming have proved to be much more elusive and difficult  ... 

Strong Negation in Well-Founded and Partial Stable Semantics for Logic Programs [chapter]

Pedro Cabalar, Sergei Odintsov, David Pearce
2006 Lecture Notes in Computer Science  
A formalism called partial equilibrium logic (PEL) has recently been proposed as a logical foundation for the well-founded semantics (WFS) of logic programs.  ...  In PEL one defines a class of minimal models, called partial equilibrium models, in a non-classical logic, HT 2 .  ...  Until recently there was no comparable foundational study for well-founded and p-stable semantics; an underlying, monotonic base logic was missing.  ... 
doi:10.1007/11874850_63 fatcat:qdlb2k7gg5ghfb3rjpjykbi4ce

Page 7309 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
Well-founded recursion expresses recursive func- tions over inductive data types; corecursion expresses functions that yield elements of coinductive data types.  ...  Aczel, Non-well-founded sets, Stanford Univ., Stanford, CA, 1988; MR 89j:03039] and proving the unification lemma, which gives a cer- tain characterization condition for the system of subsumption constraints  ... 
« Previous Showing results 1 — 15 out of 107,590 results