Sciweavers

308 search results - page 17 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
RULEML
2005
Springer
14 years 1 months ago
Merging and Aligning Ontologies in dl-Programs
Abstract. The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top...
Kewen Wang, Grigoris Antoniou, Rodney W. Topor, Ab...
KR
2004
Springer
14 years 1 months ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
FLAIRS
2001
13 years 9 months ago
Detection of Inconsistencies in Complex Product Configuration Data Using Extended Propositional SAT-Checking
We present our consistency support tool BIS, an extension to the electronic product data management system (EPDMS) used at DaimlerChrysler AG to configure the Mercedes lines of pa...
Carsten Sinz, Andreas Kaiser, Wolfgang Küchli...
ICTAI
2005
IEEE
14 years 1 months ago
Toward a Logical Tool for Generating New Arguments in an Argumentation Based Framework
Following the framework proposed by Besnard and Hunter for argumentation, this paper aims to propose a logical tool for the generation of new arguments when two formal agents have...
Geoffroy Aubry, Vincent Risch