Sciweavers

63 search results - page 4 / 13
» Tensed Ontology Based on Simple Partial Logic
Sort
View
PEPM
2007
ACM
14 years 1 months ago
Quasi-terminating logic programs for ensuring the termination of partial evaluation
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
Germán Vidal
ENTCS
2006
189views more  ENTCS 2006»
13 years 7 months ago
Variables as Resource for Shared-Memory Programs: Semantics and Soundness
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
Stephen D. Brookes
KSEM
2007
Springer
14 years 1 months ago
Ontology-Based Inference for Causal Explanation
We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We first introduce a simple logical language...
Philippe Besnard, Marie-Odile Cordier, Yves Moinar...
WWW
2005
ACM
14 years 8 months ago
Debugging OWL ontologies
As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors ...
Bijan Parsia, Evren Sirin, Aditya Kalyanpur
ICMLA
2007
13 years 9 months ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec