The following pages link to Angelos Charalambidis (Q512648):
Displaying 12 items.
- Equivalence of two fixed-point semantics for definitional higher-order logic programs (Q512650) (← links)
- Efficient intensional implementation for lazy functional languages (Q1001354) (← links)
- Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (Q2931276) (← links)
- Extensional Higher-Order Logic Programming (Q2946709) (← links)
- Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803) (← links)
- A Refinement Operator for Inducing Threaded-Variable Clauses (Q4928404) (← links)
- (Q5014440) (← links)
- A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction (Q5019604) (← links)
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective (Q5038473) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← links)
- A Fixed Point Theorem on Lexicographic Lattice Structures (Q5145643) (← links)
- Overview of an Abstract Fixed Point Theory for Non-Monotonic Functions and its Applications to Logic Programming (Q5350159) (← links)
