Sciweavers

162 search results - page 11 / 33
» Completeness Guarantees for Incomplete Reasoners
Sort
View
AAAI
2000
14 years 11 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
JELIA
2004
Springer
15 years 3 months ago
Towards a Logical Analysis of Biochemical Pathways
Biochemical pathways or networks are generic representations used to model many different types of complex functional and physical interactions in biological systems. Models based ...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
DLOG
1998
14 years 11 months ago
A Description Logic System for Learning in Complex Domains
This paper introduces YAYA1, a Description Logic system focused towards learning complex interrelations among objects. YAYA Concept Language (YCL) is quite restricted; although it...
Jordi Alvarez
ICLP
2010
Springer
14 years 8 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
15 years 3 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton