The following pages link to Christos Nomikos (Q345701):
Displaying 25 items.
- Game semantics for non-monotonic intensional logic programming (Q345702) (← 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)
- Satisfying a maximum number of pre-routed requests in all-optical rings. (Q1400411) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Default consequence relations from topology and measure theory (Q2122773) (← links)
- A limit characterization for the number of spanning trees of graphs (Q2390271) (← links)
- Temporal stratification tests for linear and branching-time deductive databases (Q2566298) (← links)
- Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost (Q2575919) (← links)
- (Q2758303) (← links)
- Game Semantics for Non-monotonic Intensional Logic Programming (Q2851265) (← links)
- Notions of Bisimulation for Heyting-Valued Modal Languages (Q2882558) (← links)
- A PROOF PROCEDURE FOR TEMPORAL LOGIC PROGRAMMING (Q3022009) (← links)
- Randomized and Approximation Algorithms for Blue-Red Matching (Q3525614) (← links)
- Well-Founded Semantics for Boolean Grammars (Q3617058) (← links)
- A Game-Theoretic Characterization of Boolean Grammars (Q3637237) (← links)
- (Q3647307) (← links)
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective (Q5038473) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← links)
- Stathis Zachos at 70! (Q5283390) (← links)
- Logic Programming (Q5475797) (← links)
- On a Simple 3-valued Modal Language and a 3-valued Logic of 'not-fully-justified' Belief (Q5504123) (← links)
- On weak filters and ultrafilters: Set theory from (and for) knowledge representation (Q5877707) (← links)
