Sciweavers

4513 search results - page 270 / 903
» Logic programming with satisfiability
Sort
View
GCC
2003
Springer
15 years 9 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
ECML
2006
Springer
15 years 7 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
CADE
2008
Springer
16 years 4 months ago
Individual Reuse in Description Logic Reasoning
Abstract. Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowl...
Boris Motik, Ian Horrocks
KBSE
1999
IEEE
15 years 8 months ago
Controlled Natural Language Can Replace First-Order Logic
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...
Norbert E. Fuchs, Uta Schwertel, Sunna Torge
ENTCS
2008
96views more  ENTCS 2008»
15 years 4 months ago
Undecidability of Model Checking in Brane Logic
The Brane Calculus is a calculus intended to model the structure and the dynamics of biological membranes. In order to express properties of systems in this calculus, in previous ...
Giorgio Bacci, Marino Miculan