Sciweavers

110 search results - page 14 / 22
» A Logic of Limited Belief for Reasoning with Disjunctive Inf...
Sort
View
SAT
2005
Springer
145views Hardware» more  SAT 2005»
14 years 1 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
JAR
2006
94views more  JAR 2006»
13 years 8 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
AAAI
2006
13 years 9 months ago
Finding Maximally Satisfiable Terminologies for the Description Logic ALC
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
Thomas Andreas Meyer, Kevin Lee, Richard Booth, Je...
KES
2004
Springer
14 years 1 months ago
Epistemic Logic and Planning
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
Shahin Maghsoudi, Ian Watson
ARTMED
2006
80views more  ARTMED 2006»
13 years 8 months ago
A formal theory for spatial representation and reasoning in biomedical ontologies
Objective: The objective of this paper is to demonstrate how a formal spatial theory can be used as an important tool for disambiguating the spatial information embodied in biomed...
Maureen Donnelly, Thomas Bittner, Cornelius Rosse