Sciweavers

1321 search results - page 89 / 265
» Subtyping in Logical Form
Sort
View
DLOG
2008
15 years 7 months ago
Rewriting Rules into SROIQ Axioms
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with t...
Francis Gasse, Ulrike Sattler, Volker Haarslev
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
15 years 5 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
ENTCS
2006
90views more  ENTCS 2006»
15 years 5 months ago
A Framework for Engineering Interactions in Java-based Component Systems
This paper describes a Java-based framework for the development of componentbased software systems supporting the specification of the logic of component interactions as a first-c...
Antonio Natali, Enrico Oliva, Alessandro Ricci, Mi...
JAPLL
2008
76views more  JAPLL 2008»
15 years 5 months ago
The many faces of counts-as: A formal analysis of constitutive rules
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...
Davide Grossi, John-Jules Ch. Meyer, Frank Dignum
CADE
2012
Springer
13 years 7 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...