A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants
2004
Fuzzy sets and systems (Print)
Preserved Fulltext
Acknowledgements 11 The authors acknowledge the anonymous referees for interesting comments. This research has been partially supported by the Spanish CYCIT project LOGFAC (TIC2001-1577-C03-01/03). ...
y) and can be computed as soon as variables x and y are instantiated. 8 f2 is semantically equivalent to (product price([medium p]0:9); 0:9), where [medium p]0:9 denotes the -cut of the fuzzy set m(medium ...
Because of the possibilistic semantics of PLFC, r1 is semantically equivalent to (stock level(x) → order units ([a few] low(x) ); low(x)), where [a few] low(x) denotes the -cut of the fuzzy set m(a few ...
doi:10.1016/j.fss.2003.10.013
fatcat:juaxwep3r5bj5msrqddabezirq
Semantic Processing of the Semantic Web
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We show how Horn logic can be used to denotationally capture the semantics of mark-up languages designed for describing resources on the semantic web (such as RDF). ...
In this paper, we present our approach based on denotational semantics and Horn logic. ...
The Horn Logical Semantics of a language uses Horn-clause logic (or pure Prolog) to code all three components of the denotational semantics of a language [20] . ...
doi:10.1007/978-3-540-39718-2_6
fatcat:narzzrbl4jfuhgsmyywyml3wiu
The Semantics of Predicate Logic as a Programming Language
1976
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
As a machine independent alternative to operational semantics, fixpoint semantics [1, 6, 17, 22] defines the meamng of a program to be the inputoutput relation which ts the mimmal fixpoint of a transformation ...
In this paper we ignore the practical aspects of programming m logic and investigate instead the semantics of predicate logic regarded as a programming language. ...
Thanks are due also to Ketth Clark, Alain Colmerauer, Gerard Huet, David Park, and Wlllem-Paul de Roever for their helpful comments on earher versions of the paper. ...
doi:10.1145/321978.321991
fatcat:qk7ktvyv3fbyvc2d5qiwgozgge
Extended Horn clauses: the framework and some semantics
[chapter]
1991
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The extended framework -ntially rests on an extension of Horn clauses, including multiple atoms in their head.a and a guard construct, u well u. a new operator between goals. ...
operator to the extended framework, and of a denotational semantics, defined compositionally and on the basis of histories pouibly involving hypothetical statements. ...
The first author likes to thank the members of the C.W.I. concurrency group, J.W. de Bakker, F. de Boer, F. van Breugel, A. de Bruin, E. Horita, P. Knijnenburg, J. Kok, E. Marchiori, C. ...
doi:10.1007/3-540-54430-5_95
fatcat:hgtpjmdj7zakpc3vj5eifu4fta
Soft typing for ordered resolution
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a variant of ordered resolution with semantic restrictions based on interpretations which are identi ed by the given atom ordering and selection function. ...
Implementation of some of our techniques in the Spass prover has lead to encouraging experimental results. ...
Where not speci ed otherwise, letters A and B denote atoms, L denotes literals, C and D denote clauses, and the letter N denotes a set of clauses. Clauses will be written both in sequent notation ; ! ...
doi:10.1007/3-540-63104-6_32
fatcat:sidm2gcacjeptpwdesjvcifqlu
Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
with recursion controlled by the later modality; and soundness of both proof systems is proven relative to a novel coalgebraic description of complete Herbrand models. ...
Operational semantics of coinductive Horn clause resolution is cast in terms of coinductive uniform proofs; its constructive content is exposed via soundness relative to an intuitionistic first-order logic ...
We would like to thank Damien Pous and the anonymous reviewers for their valuable feedback. ...
doi:10.1007/978-3-030-17184-1_28
fatcat:7azord5jkjhlvdxyir54hjsdqq
CoALP-Ty'16
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This volume constitutes the pre-proceedings of the Workshop on Coalgebra, Horn Clause Logic Programming and Types (CoALP-Ty'16), held on 28--29 November 2016 in Edinburgh as a mark of the end of the EPSRC ...
Clause Logic for Type Inference in Functional Languages and Beyond After discussion at the workshop authors of the extended abstracts will be invited to submit a full paper to go through a second round ...
This in turn gives us a universe of discourse for exploring other semantics and proof systems for mixed inductive-coinductive logic programs. ...
arXiv:1612.03032v1
fatcat:d6gug5imufgwbcslntnyts4nim
Towards a formal foundation for domain specific modeling languages
2006
Proceedings of the 6th ACM & IEEE International conference on Embedded software - EMSOFT '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, in the effort to produce a mature design approach that can handle both the structural and behavioral semantics of embedded system design, many foundational issues concerning DSMLs have been overlooked ...
The success of the DSML approach has encouraged work on the heterogeneous composition of DSMLs, model transformations between DSMLs, approximations of formal properties within DSMLs, and reuse of DSML ...
For some model r ∈ RΥ, we denote the i th interpretation of r as r i. The interpretations capture the semantics of a domain. ...
doi:10.1145/1176887.1176896
dblp:conf/emsoft/JacksonS06
fatcat:fel5udc6jjeojlgljifbbmdnqi
Exploiting data dependencies in many-valued logics
1996
Journal of Applied Non-Classical Logics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We give a many-valued version of polarity which in turn leads to natural many-valued counterparts of Horn formulas, hyperresolution, and a Davis-Putnam procedure. ...
We are working with a notion of many-valued first-order clauses which any finitely-valued logic formula can be translated into and that has been used several times in the literature, but in an ad hoc way ...
Acknowledgements The detailed remarks of the referees led to a better presentation of some parts and to the removal of a notational error in the definition of direct products for many-valued structures ...
doi:10.1080/11663081.1996.10510866
fatcat:padhw3woozeffnzzqufozt727m
Page 6188 of Mathematical Reviews Vol. , Issue 91K
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “A declarative semantics of a concurrent programming language based on Horn logic such as flat guarded Horn clauses is presented. The domain of input/output (I/O) histories is intro- duced. ...
The model of a program is defined as a set of I/O histories. The notion of truth is redefined for goal clauses and sets of guarded clauses. ...
Verifying Relational Program Properties by Transforming Constrained Horn clauses
2016
Italian Conference on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
same solvers are unable to perform those proofs when given as input the original sets of constrained Horn clauses. ...
That definition consists of a set Int of constrained Horn clauses (CHC) that encode the interpreter of the programming language. ...
We acknowledge the financial support of INdAM-GNCS (Italy). ...
dblp:conf/cilc/AngelisFPP16
fatcat:lpag5loxw5bndcn5neoqbn2l4y
Generalised Kernel Sets for Inverse Entailment
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The task of inverting logical entailment is of central impor- ...
In practice, known proof procedures for BG are limited to Horn clause logic; as evidenced, for example, by the state-of-the-art ILP system Progol [6] . Recently, Ray et al. ...
In this section the semantics of KSS is generalised from Horn clauses to arbitrary clauses. ...
doi:10.1007/978-3-540-27775-0_12
fatcat:4fdee6ovsnguvd2c5smmt3u5aq
Page 815 of Mathematical Reviews Vol. , Issue 86b
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In this paper, we present the formalism of Horn-oriented equational clauses (Horn clauses with a rewrite rule as the head part, and a list of equations as the body part). ...
Author’s summary: “In the Prolog language, Horn clauses of first- order logic are regarded as programs, and the resolution procedure is used as an interpreter. ...
Semantics and Consistency of Rule based Expert Systems
1991
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Consistency of a knowledge-based system has become a topic of growing concern. Every notion of consistency presupposes a notion of semantics. ...
We present a theoretical framework in which both the semantics and the consistency of a knowledge base can be studied. ...
The connection between Horn clauses and production rules is easily seen by the equivalence of (A 1 /\ • • • /\Ak) ~ B and A 1 v · · · v A;; v B+, where the superscripts + anddenote whether a literal occurs ...
doi:10.1093/logcom/1.4.477
fatcat:u6b465karfbnzmow3f7f2mjlda
Compositional analysis of modular logic programs
1993
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A logic program is viewed as consisting of a set of modules, each module de ning a subset of the program's predicates. ...
This paper describes a semantic basis for a compositional approach to the analysis of logic programs. ...
A logic program (or module) is a nite set of clauses. The set of clauses constructed from elements of Atom is denoted Clause. ...
doi:10.1145/158511.158703
dblp:conf/popl/CodishDG93
fatcat:eiwvhao4qjcazn3onmskmn5pey
« Previous
Showing results 1 — 15 out of 4,302 results