Sciweavers

1194 search results - page 120 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
IM
1997
13 years 10 months ago
Active Objects in TMN
Telecommunications Management Network (TMN) systems use the object-oriented information modelling techniques and communication facilities provided by OSI Systems Management (SM). ...
Anastasia Vassila, George Pavlou, Graham Knight
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 10 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
APLAS
2010
ACM
13 years 9 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
ICLP
2009
Springer
14 years 10 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
CAV
1999
Springer
119views Hardware» more  CAV 1999»
14 years 1 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund