Results 11 to 20 of about 220,610 (290)

Update rules and semantic universals

open access: yesLinguistics and Philosophy, 2022
AbstractWe discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction and, disjunction or, and negated disjunction nor; the
Luca Incurvati, Giorgio Sbardolini
openaire   +4 more sources

Declarative semantics for active rules [PDF]

open access: yesTheory and Practice of Logic Programming, 1998
In this paper we analyze declarative deterministic and non-deterministic semantics for active rules. In particular we consider several (partial) stable model semantics, previously defined for deductive rules, such as well-founded, max deterministic, unique total stable model, total stable model, and maximal stable model semantics.
FLESCA, Sergio, GRECO, Sergio
openaire   +4 more sources

Founded semantics and constraint semantics of logic rules [PDF]

open access: yesJournal of Logic and Computation, 2017
Abstract Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs, including in attempting to solve the well-known Russell’s paradox.
Liu, Yanhong A., Stoller, Scott D.
openaire   +2 more sources

Structured Operational Semantics for Graph Rewriting [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics. While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general.
Andrei Dorman, Tobias Heindel
doaj   +1 more source

A Variety of Nabla Hardy’s Type Inequality on Time Scales

open access: yesMathematics, 2022
The primary goal of this research is to prove some new Hardy-type ∇-conformable dynamic inequalities by employing product rule, integration by parts, chain rule and (γ,a)-nabla Hölder inequality on time scales.
Ahmed A. El-Deeb   +3 more
doaj   +1 more source

Semantic representation and interval roughness analysis of IoT CapBAC rules

open access: yesTongxin xuebao, 2021
To break the bottleneck of interval roughness analysis, a rule semantic model IoTACS was proposed, and IoTRA algorithm was given.In IoTACS, a conceptual structure of the IoT CapBAC rule domain was proposed, the quantitative data properties of the basic ...
Xiaoyan LIANG, Ruizhong DU
doaj   +2 more sources

Exploration of Outliers in If-Then Rule-Based Knowledge Bases

open access: yesEntropy, 2020
The article presents both methods of clustering and outlier detection in complex data, such as rule-based knowledge bases. What distinguishes this work from others is, first, the application of clustering algorithms to rules in domain knowledge bases ...
Agnieszka Nowak-Brzezińska   +1 more
doaj   +1 more source

Program Semantics and Classical Logic [PDF]

open access: yes, 1997
In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible.
Muskens Reinhard, Reinhard Muskens
core   +8 more sources

Semantic Rule Based Program Monitoring (S) [PDF]

open access: yesInternational Conferences on Software Engineering and Knowledge Engineering, 2019
Program monitoring aims at making sure the functionalities of the software are always correctly performed during runtime. Semantic Web provides a context enriched framework for data representation and manipulation. This paper proposed the use of ontological rules and reasoning engines to monitor the dynamic behaviours of computer systems in handling of
Tudor, Luke   +3 more
openaire   +1 more source

A Branch and Bound Algorithm for Counting Independent Sets on Grid Graphs

open access: yesComputer Sciences & Mathematics Forum, 2023
A relevant problem in combinatorial mathematics is the problem of counting independent sets of a graph G, denoted by i(G). This problem has many applications in combinatorics, physics, chemistry and computer science.
Guillermo De Ita   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy