Sciweavers

662 search results - page 16 / 133
» Logic Programming with Ordered Disjunction
Sort
View
COLOGNETWENTE
2009
13 years 8 months ago
Improved Strategies for Branching on General Disjunctions
Abstract Within the context of solving Mixed-Integer Linear Programs by a Branch-andCut algorithm, we propose a new strategy for branching. Computational experiments show that, on ...
Gérard Cornuéjols, Leo Liberti, Giac...
AAAI
2000
13 years 8 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary
RR
2010
Springer
13 years 5 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
IJCAI
2007
13 years 9 months ago
Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been propo...
Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans T...
LANMR
2004
13 years 8 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad