نتایج جستجو برای: feasible answer

تعداد نتایج: 160215  

Journal: :CoRR 2006
Tarik Hadzic Rune M. Jensen Henrik Reif Andersen

In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largely based on the CLab [1] configuration framework.

2011
Giuseppe Cuccu Faustino J. Gomez

The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intelligent behavior. So far, novelty search has only been studied in the context of problems where the number of possible “different” solutions has been limited. In this paper, we show, using a task with a much larger solution space,...

Journal: :Proceedings of the AAAI Conference on Artificial Intelligence 2020

2012
Maxime Folschette Loïc Paulevé Katsumi Inoue Morgan Magnin Olivier F. Roux

The Process Hitting (PH) is a recently introduced framework to model concurrent processes. Its major originality lies in a specific restriction on the causality of actions, which makes the formal analysis of very large systems tractable. PH is suitable to model Biological Regulatory Networks (BRNs) with complete or partial knowledge of cooperations between regulators by defining the most permis...

2011
Thang M. Do Seng Wai Loke Fei Liu

This paper explores Answer Set Programming (ASP) for stream reasoning with data retrieved continuously from sensors. We describe a proof-of-concept with an example of using declarative models to recognize car on-road situations.

2017
Gopal Gupta Elmer Salazar Kyle Marple Zhuo Chen Farhad Shakerin

Journal: :CoRR 2017
Sergey Paramonov Christian Bessiere Anton Dries Luc De Raedt

Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Answer Set Programming (SkASP), aiming at supporting the user in resolving this issue. The user writes an ASP program while marking uncertain parts open with question marks. In addition, the user provides a number of pos...

Journal: :TPLP 2017
Tomi Janhunen Roland Kaminski Max Ostrowski Torsten Schaub Sebastian Schellhorn Philipp Wanko

The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. Mor...

2010
Halit Erdogan Olivier Bodenreider Esra Erdem

We introduce a new method to find semantic inconsistencies (i.e., concepts with erroneous synonymity) in the Unified Medical Language System (UMLS). The idea is to identify the inconsistencies by comparing the semantic groups of hierarchically-related concepts using Answer Set Programming. With this method, we identified several inconsistent concepts in UMLS and discovered an interesting semant...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید