Results 1 to 10 of about 1,720 (220)
Querying the Guarded Fragment [PDF]
Logical Methods in Computer Science, 2014 Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic.
Vince Bárány +2 more
doaj +8 more sources
THE TERM COMBINATION AND THE METAPHOR IN THE OFFICIAL BUSINESS DOCUMENT: COGNITIVE ASPECT [PDF]
Вісник університету ім. А. Нобеля. Серія Філологічні науки, 2023 In this paper, the military term combinations and military metaphors in the official documents are identified and analyzed by the methods of corpus and cognitive linguistics.
Yuliya I. Demyanchuk.
doaj +1 more source
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj +1 more source
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source
First Autochthonous Infection of a Cat with Dirofilaria immitis in Austria
Pathogens, 2021 This case report is about a seven-year-old male neutered European Shorthair cat infected by Dirofilaria immitis as the first reported autochthonous Dirofilaria immitis infection in Austria. There was no history of periods abroad.
Lisa-Maria Kulmer +7 more
doaj +1 more source
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2009 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic.
Johan van Benthem +2 more
doaj +1 more source
A multi-paradigm language for reactive synthesis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 This paper proposes a language for describing reactive synthesis problems that integrates imperative and declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information.
Ioannis Filippidis +2 more
doaj +1 more source
Preservation theorems for Tarski's relation algebra [PDF]
Logical Methods in Computer ScienceWe investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations.
Bart Bogaerts +3 more
doaj +1 more source
On two-variable guarded fragment logic with expressive local Presburger constraints [PDF]
Logical Methods in Computer ScienceWe consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges is at ...
Chia-Hsuan Lu, Tony Tan
doaj +1 more source
Generalising KAT to Verify Weighted Computations
Scientific Annals of Computer Science, 2019 Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests.
Leandro Gomes +2 more
doaj +1 more source