Sciweavers

4978 search results - page 327 / 996
» Logical models of argument
Sort
View
SLP
1993
110views more  SLP 1993»
15 years 7 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
SPIESR
1996
141views Database» more  SPIESR 1996»
15 years 7 months ago
Describing and Classifying Multimedia Using the Description Logic GRAIL
Many applications would benefit if media objects such as images could be selected and classified (or clustered) such that "conceptually similar" images are grouped toget...
Carole A. Goble, Christian Haul, Sean Bechhofer
IJAR
2010
91views more  IJAR 2010»
15 years 4 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
TAP
2010
Springer
134views Hardware» more  TAP 2010»
15 years 4 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
FOSSACS
1999
Springer
15 years 10 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro