Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems

2021 ◽  
pp. 327-345
Author(s):  
K. Subramani ◽  
Piotr Wojciechowski
Keyword(s):  
Parameterized Algorithms ◽  
Constraint Systems

Parameterized Algorithms for Total p-Dominating Set

2014 ◽  
Vol 36 (9) ◽  
pp. 1868-1879
Author(s):  
Wei-Zhong LUO ◽  
Qi-Long FENG ◽  
Jian-Xin WANG ◽  
Jian-Er CHEN
Keyword(s):  
Dominating Set ◽  
Parameterized Algorithms ◽  
Total P

scholarly journals Analyzing fractional Horn constraint systems

2020 ◽  
Vol 844 ◽  
pp. 142-153
Author(s):  
Piotr Wojciechowski ◽  
R. Chandrasekaran ◽  
K. Subramani
Keyword(s):  
Constraint Systems

scholarly journals Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms

2020 ◽  
Vol 16 (3) ◽  
pp. 1-31
Author(s):  
Daniel Lokshtanov ◽  
Fahad Panolan ◽  
Saket Saurabh ◽  
Roohani Sharma ◽  
Meirav Zehavi
Keyword(s):  
Independent Sets ◽  
Parameterized Algorithms

NENOK — A SOFTWARE ARCHITECTURE FOR GENERIC INFERENCE

2010 ◽  
Vol 19 (01) ◽  
pp. 65-99 ◽  
Author(s):  
MARC POULY
Keyword(s):  
Programming Languages ◽  
Software Library ◽  
Inference Process ◽  
Software Projects ◽  
Open Problems ◽  
Constraint Systems ◽  
Fast Prototyping ◽  
Inference Algorithms ◽  
Key Competences ◽  
High Level

Computing inference from a given knowledgebase is one of the key competences of computer science. Therefore, numerous formalisms and specialized inference routines have been introduced and implemented for this task. Typical examples are Bayesian networks, constraint systems or different kinds of logic. It is known today that these formalisms can be unified under a common algebraic roof called valuation algebra. Based on this system, generic inference algorithms for the processing of arbitrary valuation algebras can be defined. Researchers benefit from this high level of abstraction to address open problems independently of the underlying formalism. It is therefore all the more astonishing that this theory did not find its way into concrete software projects. Indeed, all modern programming languages for example provide generic sorting procedures, but generic inference algorithms are still mythical creatures. NENOK breaks a new ground and offers an extensive library of generic inference tools based on the valuation algebra framework. All methods are implemented as distributed algorithms that process local and remote knowledgebases in a transparent manner. Besides its main purpose as software library, NENOK also provides a sophisticated graphical user interface to inspect the inference process and the involved graphical structures. This can be used for educational purposes but also as a fast prototyping architecture for inference formalisms.

scholarly journals Faster Parameterized Algorithms Using Linear Programming

2014 ◽  
Vol 11 (2) ◽  
pp. 1-31 ◽  
Author(s):  
Daniel Lokshtanov ◽  
N. S. Narayanaswamy ◽  
Venkatesh Raman ◽  
M. S. Ramanujan ◽  
Saket Saurabh
Keyword(s):  
Linear Programming ◽  
Parameterized Algorithms

Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment

2006 ◽  
Vol 3 (4) ◽  
pp. 423-432 ◽  
Author(s):  
Yinglei Song ◽  
Chunmei Liu ◽  
Xiuzhen Huang ◽  
Russell Malmberg ◽  
Ying Xu ◽  
...  
Keyword(s):  
Sequence Alignment ◽  
Parameterized Algorithms ◽  
Biopolymer Structure

scholarly journals Re-parameterization reduces irreducible geometric constraint systems

2016 ◽  
Vol 70 ◽  
pp. 182-192 ◽  
Author(s):  
Hichem Barki ◽  
Lincong Fang ◽  
Dominique Michelucci ◽  
Sebti Foufou
Keyword(s):  
Geometric Constraint ◽  
Constraint Systems

scholarly journals New Approach for Quantization of Second Class Constraint Systems

2014 ◽  
Vol 14 (7) ◽  
pp. 617-619 ◽  
Author(s):  
A. Farmany ◽  
M. Hatami ◽  
H. Noorizadeh ◽  
S.S. Mortazavi
Keyword(s):  
Class Constraint ◽  
New Approach ◽  
Constraint Systems
Sign in / Sign up

Export Citation Format

Share Document