Filters








7,760 Hits in 5.6 sec

Structural Operational Semantics and Modal Logic, Revisited

Bartek Klin
2010 Electronical Notes in Theoretical Computer Science  
A previously introduced combination of the bialgebraic approach to structural operational semantics with coalgebraic modal logic is re-examined and improved in some aspects.  ...  Firstly, a more abstract, conceptual proof of the main compositionality theorem is given, based on an understanding of modal logic as a study of coalgebras in slice categories of adjunctions.  ...  One may argue that, just as structural operational semantics is a study of coalgebra in categories of algebras, coalgebraic modal logic is a study of (co)algebra in slice categories.  ... 
doi:10.1016/j.entcs.2010.07.019 fatcat:5ndmofo7l5h6nfnod5ilzfxgdu

A user's guide to operator algebras

1996 Computers and Mathematics with Applications  
Propositional modal logic as many-sorted logic. 5. First order modal logic as many-sorted logic (Applying many-sorted logic to dynamic logic). 6. Dynamic logic. 7.  ...  General plan (Applying many-sorted logic to higher order logic). 2. Higher order logic as many-sorted logic (Applying many-sorted logic to modal logic). 3. Modal logic. 4.  ... 
doi:10.1016/s0898-1221(96)90237-0 fatcat:v3e6obbnmjbbvec5infj65bmka

Page 6713 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational se- mantics using structures often called Kripke models.  ...  Summary: “The paper revisits a class of model structures intro- duced by the author in 1974, with particular attention to the system SCon, which axiomatizes the universal class.  ... 

Book announcements

1993 Discrete Applied Mathematics  
Chapter 5: Modal Logic. Formal details of possible worlds semantics. Axioms for modal logic.Chapter 6: Temporal Reasoning. Modal logics of time. Reification of temporal logic. The situation calculus.  ...  Chapter 3: Theorem proving techniques for modal logic. Reasoning about knowledge. Combining knowledge and action. Belief structures. inference. Uses of non-monotonic rules.  ... 
doi:10.1016/0166-218x(93)90173-l fatcat:l4psazjvkjcm5ksswvubyespla

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

1995 Mathematical Reviews  
Gabriel Ciobanu (Iasi) 95a:68075 68Q55 03D45 Spreen, Dieter (D-SGN-TI; Siegen) Effective operators and continuity revisited.  ...  These equivalences are defined in terms of the operational rules of actions; both can be characterized in terms of appropriate modal logics.  ... 

Forthcoming Papers

2002 Artificial Intelligence  
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning.  ...  We develop a general semantic approach to autoepistemic and default logics that is based on the notion of a belief pair and that exploits the lattice structure of the collection of all belief pairs.  ...  ., databases, machine learning, and statistics.  ... 
doi:10.1016/s0004-3702(02)00352-1 fatcat:whr5z6yi5bhd3du43jekqpvwoi

Uniform semantic treatment of default and autoepistemic logics [article]

Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
2000 arXiv   pre-print
We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic.  ...  However, as we also demonstrate, the semantics of Moore and Reiter are given by different operators and occupy different locations in their corresponding families of semantics.  ...  Acknowledgements This work was partially supported by the NSF grants CDA-9502645 and IRI-9619233.  ... 
arXiv:cs/0002002v1 fatcat:mmzapua3cbhjvkrmsq4jbo3pfm

Page 4879 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
The modal analysis of indiscernibility and comple- mentarity is performed through a modal logic in which modalities correspond to indiscernibility relations and complementarity rela- tions in information  ...  Summary: “We revisit the issue of epistemological and seman- tic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning.  ... 

Saturation-based theorem proving: Past successes and future potential [chapter]

Harald Ganzinger
1996 Lecture Notes in Computer Science  
for modal logics from propositional decision procedures -the case study of modal K p. 583 Resolution-based calculi for modal and temporal logics p. 598 Tableaux and algorithms for propositional  ...  Lemma discovery in automating induction p. 538 Advanced indexing operations on substitution trees p. 553 Semantic trees revisited: some new completeness results p. 568 Building decision procedures  ... 
doi:10.1007/3-540-61511-3_64 fatcat:iizfu32trnfadmj4z7xcvwds5y

Page 5089 of Mathematical Reviews Vol. , Issue 93i [page]

1993 Mathematical Reviews  
In this paper we extend the method to multimodal logic and apply it to modal logic programming.  ...  We investigate and compare operational, denotational and logical descriptions of the ISWIM-SECD system.  ... 

Page 4593 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
Modal realism and the semantics of modal logic. The Clarendon Press, Oxford University Press, New York, 1998. xii+342 pp. $55.00.  ...  , Explicitly typed Au-calculus for polymorphism and call-by-value (162-176); Healf- dene Goguen, Soundness of the logical framework for its typed operational semantics (extended abstract) (177-197); Masahito  ... 

Revisiting Epistemic Specifications [article]

Miroslaw Truszczynski
2011 arXiv   pre-print
In this paper, we revisit the formalism of epistemic specification.  ...  complexity results and, finally, show the effectiveness of the formalism for modeling problems requiring meta-reasoning considered recently by Faber and Woltran.  ...  a modal operator K.  ... 
arXiv:1108.3279v1 fatcat:zxtf2iwlhngmndhlqscbanrh3i

Revisiting Epistemic Specifications [chapter]

Mirosław Truszczyński
2011 Lecture Notes in Computer Science  
In this paper, we revisit the formalism of epistemic specification.  ...  We offer a new definition of the formalism, propose several semantics (one of which, under syntactic restrictions we assume, turns out to be equivalent to the original semantics by Gelfond), derive some  ...  a modal operator K.  ... 
doi:10.1007/978-3-642-20832-4_20 fatcat:cwtxzyqz4ndudepjmxdmli3h2i

Page 3125 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
Yde Venema and Maarten Marx, A modal logic of relations (124-167); Frank Wolter and Michael Zakharyaschev [M. V.  ...  Stenning and Richard Cox, Hy- perproof: abstraction, visual preference and modality ( : Denise Aboim Sande e Oliveira, Clarisse Sieckenius de Souza and Edward Hermann Haeusler, Structured argument generation  ... 

Uniform semantic treatment of default and autoepistemic logics

Marc Denecker, Victor W. Marek, Mirosław Truszczyński
2003 Artificial Intelligence  
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning.  ...  We develop a general semantic approach to autoepistemic and default logics that is based on the notion of a belief pair and that exploits the lattice structure of the collection of all belief pairs.  ...  semantic studies of modal logics.  ... 
doi:10.1016/s0004-3702(02)00293-x fatcat:zpyvjdfugngkxloqxh6ma4pl7m
« Previous Showing results 1 — 15 out of 7,760 results