The following pages link to V. S. Subrahmanian (Q197490):
Displaying 50 items.
- Diffusion centrality: a paradigm to maximize spread in social networks (Q322073) (← links)
- Focused most probable world computations in probabilistic logic programs (Q454145) (← links)
- Improving performance of heterogeneous agents (Q596481) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- Annotated nonmonotonic rule systems (Q673384) (← links)
- Computing the fault tolerance of multi-agent deployment (Q835818) (← links)
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251) (← links)
- Protected completions of first-order general logic programs (Q911800) (← links)
- Paraconsistent disjunctive deductive databases (Q1185011) (← links)
- Stable and extension class theory for logic programs and default logics (Q1197387) (← links)
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545) (← links)
- Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
- Probabilistic logic programming (Q1207942) (← links)
- Paraconsistent logic programming (Q1262746) (← links)
- Heterogeneous active agents, I: Semantics (Q1285674) (← links)
- Heterogeneous active agents, II: Algorithms and complexity (Q1285675) (← links)
- Completeness issues in RUE-NRF deduction: The undecidability of viability (Q1311402) (← links)
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning (Q1311405) (← links)
- A semantical framework for supporting subjective and conditional probabilities in deductive databases (Q1311410) (← links)
- Stable semantics for probabilistic deductive databases (Q1322464) (← links)
- Computing definite logic programs by partial instantiation (Q1326778) (← links)
- Computing circumscriptive databases (Q1346715) (← links)
- Disjunctive \(LP+\) integrity constraints = stable model semantics. (Q1353944) (← links)
- The logic of totally and partially ordered plans: A deductive database approach (Q1370626) (← links)
- Foundations of distributed interaction systems (Q1601847) (← links)
- Applications of paraconsistency in data and knowledge bases (Q1840972) (← links)
- Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
- An algebra for creating and querying multimedia presentations (Q1856242) (← links)
- Secure agents (Q1861902) (← links)
- Heterogeneous active agents. III: Polynomially implementable agents (Q1978315) (← links)
- An AGM-style belief revision mechanism for probabilistic spatio-temporal logics (Q2269133) (← links)
- A temporal database forecasting algebra (Q2353923) (← links)
- Policy-based inconsistency management in relational databases (Q2353971) (← links)
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds (Q2426104) (← links)
- Using Generalized Annotated Programs to Solve Social Network Optimization Problems (Q2883091) (← links)
- Abductive Inference in Probabilistic Logic Programs (Q2883092) (← links)
- Privacy Preservation Using Multi-context Systems and Default Logic (Q2900519) (← links)
- (Q2909166) (← links)
- Annotated RDF (Q2946598) (← links)
- Annotated Probabilistic Temporal Logic (Q2946661) (← links)
- Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems (Q2946695) (← links)
- Parallel Abductive Query Answering in Probabilistic Logic Programs (Q2946697) (← links)
- Super-Solutions (Q2946725) (← links)
- (Q2996249) (← links)
- Approximate Achievability in Event Databases (Q3011986) (← links)
- (Q3046912) (← links)
- Amalgamating knowledge bases, III: Algorithms, data structures and query processing (Q3129507) (← links)
- (Q3199402) (← links)
- A RING-THEORETIC BASIS FOR LOGIC PROGRAMMING (Q3348392) (← links)
