Sciweavers

387 search results - page 32 / 78
» Hyperequivalence of Logic Programs with Respect to Supported...
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 8 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
ECOOP
2008
Springer
13 years 10 months ago
Extensible Universes for Object-Oriented Data Models
Abstract We present a datatype package that enables the shallow embedding technique to object-oriented specification and programming languages. This datatype package incrementally ...
Achim D. Brucker, Burkhart Wolff
CP
2004
Springer
14 years 2 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
ICTAI
2007
IEEE
14 years 3 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
RULEML
2010
Springer
13 years 7 months ago
Visualizing Logical Dependencies in SWRL Rule Bases
Rule bases are common in many business rule applications, clinical decision support programs, and other types of intelligent systems. As the size of the rule bases grows and the in...
Saeed Hassanpour, Martin J. O'Connor, Amar K. Das