Results 1 to 10 of about 1,702,574 (147)
A Reminiscence of Classical Myth at II Peter 2.4
Greek, Roman, and Byzantine Studies, 2003 [site under construction]
Birger A. Pearson
doaj +1 more source
Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions [PDF]
Logical Methods in Computer Science, 2022 In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion.
Paul Wild, Lutz Schröder
doaj +1 more source
Geometric Model Checking of Continuous Space [PDF]
Logical Methods in Computer Science, 2022 Topological Spatial Model Checking is a recent paradigm where model checking techniques are developed for the topological interpretation of Modal Logic. The Spatial Logic of Closure Spaces, SLCS, extends Modal Logic with reachability connectives that, in
Nick Bezhanishvili +5 more
doaj +1 more source
Modal Logics of Topological Relations [PDF]
Logical Methods in Computer Science, 2006 Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI.
Carsten Lutz, Frank Wolter
doaj +1 more source
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II) [PDF]
Logical Methods in Computer Science, 2020 There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals.
Willem Conradie +2 more
doaj +1 more source
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules [PDF]
Logical Methods in Computer Science, 2010 Association rules are among the most widely employed data analysis methods in the field of Data Mining. An association rule is a form of partial implication between two sets of binary variables.
Jose L. Balcazar
doaj +1 more source
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA [PDF]
Logical Methods in Computer Science, 2006 Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons.
Willem Conradie +2 more
doaj +1 more source
Logical Methods in Computer Science, 2018 We introduce ologisms. They generate from ologs by extending their logical expressivity, from the possibility of considering constraints of equational nature only to the possibility of considering constraints of syllogistic nature, in addition.
Ruggero Pagnan
doaj +1 more source
An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part I) [PDF]
Logical Methods in Computer Science, 2018 There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals.
Willem Conradie +2 more
doaj +1 more source
Efficient Open World Reasoning for Planning [PDF]
Logical Methods in Computer Science, 2006 We consider the problem of reasoning and planning with incomplete knowledge and deterministic actions. We introduce a knowledge representation scheme called PSIPLAN that can effectively represent incompleteness of an agent's knowledge while allowing for ...
Tamara Babaian, James G. Schmolze
doaj +1 more source