Results 31 to 40 of about 220,610 (290)
Hybrid rules with well-founded semantics [PDF]
Knowledge and Information Systems, 2010 A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive negation for logic programs.
Drabent, Wlodzimierz, Maluszynski, Jan
openaire +3 more sources
ESC-Rules: Explainable, Semantically Constrained Rule Sets
, 2022 We describe a novel approach to explainable prediction of a continuous variable based on learning fuzzy weighted rules. Our model trains a set of weighted rules to maximise prediction accuracy and minimise an ontology-based 'semantic loss' function including user-specified constraints on the rules that should be learned in order to maximise the ...
Glauer, Martin +3 more
openaire +2 more sources
Glossa, 2021 Fox (2000) argues that a single principle, Rule H, can account for (i) Strong Crossover, (ii) the ban on using co-binding to sneak around Condition B, and (iii) the Dahl paradigm. The focus of this paper is Fox’s analysis of the Dahl paradigm.
Alex Drummond
doaj +2 more sources
The Semantics of Graph Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step
Detlef Plump, Sandra Steinert
doaj +1 more source
The Computational Complexity of Propositional Cirquent Calculus [PDF]
, 2015 Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Bauer, Matthew Steven
core +1 more source
Alternative Formulations of Decision Rule Learning from Neural Networks
Machine Learning and Knowledge Extraction, 2023 This paper extends recent work on decision rule learning from neural networks for tabular data classification. We propose alternative formulations to trainable Boolean logic operators as neurons with continuous weights, including trainable NAND neurons ...
Litao Qiao, Weijia Wang, Bill Lin
doaj +1 more source
Towards a Rule Interchange Language for the Web [PDF]
, 2006 This articles discusses rule languages that are needed for a a full deployment of the SemanticWeb. First, it motivates the need for such languages. Then, it presents ten theses addressing (1) the rule and/or logic languages needed on the Web, (2) data
Bry, François, Marchiori, Massimo
core +1 more source
Completing Queries: Rewriting of IncompleteWeb Queries under Schema Constraints [PDF]
, 2007 Reactive Web systems, Web services, and Web-based publish/ subscribe systems communicate events as XML messages, and in many cases require composite event detection: it is not sufficient to react to single event messages, but events have to be ...
Antoniou, Grigoris +4 more
core +3 more sources
The myth of occurrence-based semantics [PDF]
, 2020 The principle of compositionality requires that the meaning of a complex expression remains the same after substitution of synonymous expressions. Alleged counterexamples to compositionality seem to force a theoretical choice: either apparent synonyms ...
Pickel, Bryan, Rabern, Brian
core +4 more sources
On Basic Probability Logic Inequalities
Mathematics, 2021 We give some simple examples of applying some of the well-known elementary probability theory inequalities and properties in the field of logical argumentation.
Marija Boričić Joksimović
doaj +1 more source