The following pages link to Luigi Palopoli (Q483300):
Displaying 48 items.
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Outlier detection for simple default theories (Q622112) (← links)
- Reconcilable differences (Q639856) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Testing logic programs for local stratification (Q1199536) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Precise goal-independent abstract interpretation of constraint logic programs. (Q1395430) (← links)
- A plausibility description logic for handling information sources with heterogeneous data representation formats (Q1419392) (← links)
- Algorithms for selective enumeration of prime implicants (Q1606302) (← links)
- Outlying property detection with numerical attributes (Q1741295) (← links)
- On the complexity of inducing categorical and quantitative association rules (Q1884923) (← links)
- Propositional lower bounds: Algorithms and complexity (Q1978032) (← links)
- An action language for multi-agent domains (Q2060726) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Knowledge cores in large formal contexts (Q2149803) (← links)
- Second-order productivity, second-order payoffs, and the Shapley value (Q2231761) (← links)
- Outlier detection using default reasoning (Q2389688) (← links)
- Modular construction of minimal models (Q2401922) (← links)
- NP-SPEC: An executable specification language for solving all problems in NP (Q2755406) (← links)
- A technique for deriving hyponymies and overlappings from database schemes (Q2778420) (← links)
- The complexity of the nucleolus in compact games (Q2828226) (← links)
- (Q3046818) (← links)
- Extending Datalog with arrays (Q3122514) (← links)
- A language for updating logic programs and its implementation (Q3125091) (← links)
- On the complexity of identifying head-elementary-set-free programs (Q3400962) (← links)
- (Q3457238) (← links)
- Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints (Q3588641) (← links)
- (Q4314596) (← links)
- (Q4413561) (← links)
- (Q4420635) (← links)
- (Q4435982) (← links)
- Intensional and extensional integration and abstraction of heterogeneous databases (Q4510407) (← links)
- More on tractable disjunctive Datalog (Q4520177) (← links)
- Semi-automatic techniques for deriving interscheme properties from database schemes (Q4541424) (← links)
- (Q4781960) (← links)
- Computational properties of metaquerying problems (Q5267427) (← links)
- Outlier detection by logic programming (Q5277796) (← links)
- Logics in Artificial Intelligence (Q5394154) (← links)
- Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming (Q5450884) (← links)
- Discovery Science (Q5464565) (← links)
- 6-uniform Maker-Breaker game is PSPACE-complete (Q6081384) (← links)
