Sciweavers

827 search results - page 73 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
RR
2007
Springer
14 years 4 months ago
Decidability Under the Well-Founded Semantics
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
Natalia Cherchago, Pascal Hitzler, Steffen Hö...
RR
2007
Springer
14 years 4 months ago
Expressive Reasoning with Horn Rules and Fuzzy Description Logics
Abstract. This essay describes fuzzy CARIN, a knowledge representation language combining fuzzy description logics with Horn rules. Fuzzy CARIN integrates the management of fuzzy l...
Theofilos P. Mailis, Giorgos Stoilos, Giorgos B. S...
TLCA
2007
Springer
14 years 4 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
James Lipton, Susana Nieva
TLCA
2007
Springer
14 years 4 months ago
Two Session Typing Systems for Higher-Order Mobile Processes
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...
Dimitris Mostrous, Nobuko Yoshida
TYPES
2007
Springer
14 years 4 months ago
Characterising Strongly Normalising Intuitionistic Sequent Terms
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the ...
José Espírito Santo, Silvia Ghilezan...