Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,257,091 papers from all fields of science
Search
Sign In
Create Free Account
Guarded logic
Known as:
Guarded fragment
Guarded logic is a choice set of dynamic logic involved in choices, where outcomes are limited. A simple example of guarded logic is as follows: if X…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Database theory
Description logic
Dynamic logic (modal logic)
Broader (1)
Modal logic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2021
2021
Semiring Provenance for Guarded Logics
E. Grädel
,
Katrin M. Dannert
Hajnal Andréka and István Németi on Unity of…
2021
Corpus ID: 204955313
In this paper we bring together two different areas of mathematical logic, both of which are relevant for computer science…
Expand
2020
2020
Living without Beth and Craig: Explicit Definitions and Interpolants in the Guarded Fragment
J. C. Jung
,
F. Wolter
arXiv.org
2020
Corpus ID: 220347224
The guarded fragment of FO fails to have the Craig Interpolation Property (CIP) and the Projective Beth Definability Property…
Expand
2020
2020
Dichotomies in Ontology-Mediated Querying with the Guarded Fragment
André Hernich
,
C. Lutz
,
Fabio Papacchini
,
F. Wolter
ACM Transactions on Computational Logic
2020
Corpus ID: 213511513
We study ontology-mediated querying in the case where ontologies are formulated in the guarded fragment of first-order logic (GF…
Expand
2015
2015
Equivalence closure in the two-variable guarded fragment
Emanuel Kieronski
,
Ian Pratt-Hartmann
,
Lidia Tendera
Journal of Logic and Computation
2015
Corpus ID: 839933
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which…
Expand
2014
2014
Atom-canonicity, complete representations for cylindric-like algebras, and omitting types in clique guarded fragments of L ω,ω
T. Ahmed
2014
Corpus ID: 125304676
Fix a finite ordinal n > 2. We show that there exists an atomic, simple and countable representable CAn, such that its Dedekind…
Expand
2011
2011
Proof-Theoretic Soundness and Completeness
Robert Rothenberg
arXiv.org
2011
Corpus ID: 11455141
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth…
Expand
2009
2009
A Logic Based Approach to the Static Analysis of Production Systems
J. Bruijn
,
Martín Rezk
International Conference on Web Reasoning and…
2009
Corpus ID: 13956494
In this paper we present an embedding of propositional production systems into μ -calculus, and first-order production systems…
Expand
2005
2005
A Guarded Fragment for Abstract State Machines
Antje Nowack
Journal of Logic, Language and Information
2005
Corpus ID: 6150210
Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They…
Expand
2003
2003
A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae
R. Schmidt
,
U. Hustadt
CADE
2003
Corpus ID: 475386
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with…
Expand
2002
2002
Interpolation in the guarded fragment
E. Hoogland
,
M. Marx
2002
Corpus ID: 117122436
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE