454 search results - page 9 / 91 » Representation results for defeasible logic |
AICOM
2006
13 years 8 months ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
ENTCS
2007
13 years 8 months ago
2007
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
LICS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
ICTAI
2005
IEEE
14 years 2 months ago
2005
IEEE
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...