Sciweavers

308 search results - page 35 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
JALC
2006
125views more  JALC 2006»
13 years 7 months ago
A Confinement Criterion for Securely Executing Mobile Code
Mobile programs, like applets, are not only ubiquitous, but also potentially malicious. We study the case where mobile programs are executed by a host system in a secured environm...
Hervé Grall
ESWS
2009
Springer
14 years 2 months ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...
RR
2009
Springer
14 years 2 months ago
A Reasoner for Simple Conceptual Logic Programs
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
Stijn Heymans, Cristina Feier, Thomas Eiter
ASP
2001
Springer
14 years 5 days ago
A Declarative Implementation of Planning with Control
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
Aarati Parmar