Sciweavers

725 search results - page 103 / 145
» Complexity of Computing with Extended Propositional Logic Pr...
Sort
View
BIRTHDAY
2010
Springer
15 years 3 months ago
Finding Reductions Automatically
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
Michael Crouch, Neil Immerman, J. Eliot B. Moss
INFORMS
1998
150views more  INFORMS 1998»
15 years 2 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
135
Voted
AGP
1994
IEEE
15 years 6 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
ICFP
2006
ACM
16 years 2 months ago
Algebraic fusion of functions with an accumulating parameter and its improvement
We present a unifying solution to the problem of fusion of functions, where both the producer function and the consumer function have one accumulating parameter. The key idea in t...
Shin-ya Katsumata, Susumu Nishimura
142
Voted
APNOMS
2006
Springer
15 years 6 months ago
Proposal of Operation Method for Application Servers on NGN Using Unified Management Environment
Abstract. The Next Generation Network (NGN) has a multilayer logical construction. Network carriers use various tools in complex procedures to operate application servers on the NG...
Atsushi Yoshida, Yu Miyoshi, Yoshihiro Otsuka