Sciweavers

630 search results - page 64 / 126
» Symbolic Domain Decomposition
Sort
View
179
Voted
ICLP
2009
Springer
16 years 15 days ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
93
Voted
SYNASC
2006
IEEE
86views Algorithms» more  SYNASC 2006»
15 years 5 months ago
Implementing Parameterized Type Algorithm Definitions in Mathematica
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...
Alina Andreica
AIIA
2005
Springer
15 years 5 months ago
Handling Continuous-Valued Attributes in Incremental First-Order Rules Learning
Machine Learning systems are often distinguished according to the kind of representation they use, which can be either propositional or first-order logic. The framework working wi...
Teresa Maria Altomare Basile, Floriana Esposito, N...
SPLC
2010
14 years 9 months ago
Configuring Software Product Line Feature Models Based on Stakeholders' Soft and Hard Requirements
Abstract. Feature modeling is a technique for capturing commonality and variability. Feature models symbolize a representation of the possible application configuration space, and ...
Ebrahim Bagheri, Tommaso Di Noia, Azzurra Ragone, ...
JSAC
2006
108views more  JSAC 2006»
14 years 11 months ago
Distributed Nonlinear Integer Optimization for Data-Optical Internetworking
Abstract--We present a novel approach for joint optical network provisioning and Internet protocol (IP) traffic engineering, in which the IP and optical networks collaboratively op...
Anwar Elwalid, Debasis Mitra, Qiong Wang