Sciweavers

3319 search results - page 199 / 664
» Subshifts, Languages and Logic
Sort
View
ECAI
2006
Springer
15 years 10 months ago
Knowing Minimum/Maximum n Formulae
Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean `the reasoner has at least n different beliefs'. The resul...
Thomas Ågotnes, Natasha Alechina
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
15 years 6 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
ENTCS
2006
90views more  ENTCS 2006»
15 years 6 months ago
A Framework for Engineering Interactions in Java-based Component Systems
This paper describes a Java-based framework for the development of componentbased software systems supporting the specification of the logic of component interactions as a first-c...
Antonio Natali, Enrico Oliva, Alessandro Ricci, Mi...
JNCA
2007
143views more  JNCA 2007»
15 years 6 months ago
Detecting feature interactions in CPL
An approach for detecting feature interactions in IETF’s Call Processing Language (CPL) scripts is presented. The approach is logic based in the sense that it uses a logic repre...
Yiqun Xu, Luigi Logrippo, Jacques Sincennes