The following pages link to Panos Rondogiannis (Q169899):
Displayed 36 items.
- Game semantics for non-monotonic intensional logic programming (Q345702) (← links)
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- Equivalence of two fixed-point semantics for definitional higher-order logic programs (Q512650) (← links)
- A game-theoretic characterization of Boolean grammars (Q631778) (← links)
- Well-founded semantics for Boolean grammars (Q840701) (← links)
- Locally stratified Boolean grammars (Q948094) (← links)
- Strong equivalence of logic programs under the infinite-valued semantics (Q987828) (← links)
- Efficient intensional implementation for lazy functional languages (Q1001354) (← links)
- A fixed point theorem for non-monotonic functions (Q2257304) (← links)
- A limit characterization for the number of spanning trees of graphs (Q2390271) (← links)
- An infinite-game semantics for well-founded negation in logic programming (Q2474440) (← links)
- Temporal stratification tests for linear and branching-time deductive databases (Q2566298) (← links)
- Extensional Semantics for Higher-Order Logic Programs with Negation (Q2835890) (← links)
- Game Semantics for Non-monotonic Intensional Logic Programming (Q2851265) (← links)
- Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (Q2931276) (← links)
- Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars (Q2938139) (← links)
- Extensional Higher-Order Logic Programming (Q2946709) (← links)
- Well-Founded Semantics for Boolean Grammars (Q3617058) (← links)
- A Game-Theoretic Characterization of Boolean Grammars (Q3637237) (← links)
- Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs (Q4559803) (← links)
- The infinite-valued semantics: overview, recent results and future directions (Q4583316) (← links)
- The intricacies of three-valued extensional semantics for higher-order logic programs (Q4592720) (← links)
- (Q4708939) (← links)
- Branching-time logic programming: the language Cactus and its applications (Q4719299) (← links)
- (Q4808806) (← 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)
- Minimum model semantics for logic programs with negation-as-failure (Q5277727) (← links)
- Overview of an Abstract Fixed Point Theory for Non-Monotonic Functions and its Applications to Logic Programming (Q5350159) (← links)
- Logic Programming (Q5475797) (← links)
- (Q5487109) (← links)
- Temporal disjunctive logic programming (Q5929097) (← links)
- The branching-time transformation technique for chain datalog programs (Q5952811) (← links)