|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 820 occurrences of 537 keywords
|
|
|
Results
Found 3835 publication records. Showing 3547 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
103 | Stefan Porschen, Ewald Speckenmeyer |
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability |
94 | Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais |
From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets. |
MICAI |
2007 |
DBLP DOI BibTeX RDF |
|
85 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
On the Difference of Horn Theories. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
85 | Thomas Eiter, Kazuhisa Makino |
Generating All Abductive Explanations for Queries on Propositional Horn Theories. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
Horn theories, polynomial total time computation, NP-hardness, abduction, propositional logic, Computational logic |
85 | Vijay Chandru, John N. Hooker |
Extended Horn Sets In Propositional Logic. |
J. ACM |
1991 |
DBLP DOI BibTeX RDF |
propositional logic, Horn clauses |
76 | Paolo Liberatore |
Compilability and compact representations of revision of Horn knowledge bases. |
ACM Trans. Comput. Log. |
2000 |
DBLP DOI BibTeX RDF |
compilability, compact representations |
76 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Disjunctions of Horn Theories and Their Cores. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
76 | Lawrence J. Henschen, Larry Wos |
Unit Refutations and Horn Sets. |
J. ACM |
1974 |
DBLP DOI BibTeX RDF |
|
76 | Joost N. Kok |
Specializtion in Logic Programming: from Horn Clause Logic to Prolog and Concurrent Prolog. |
REX Workshop |
1989 |
DBLP DOI BibTeX RDF |
Horn Clause Logic, cut operator, committed-choice, Logic programming, Prolog, operational semantics, backtracking, synchronization mechanisms, Concurrent Prolog |
70 | Flemming Nielson, Helmut Seidl |
Control-Flow Analysis in Cubic Time. |
ESOP |
2001 |
DBLP DOI BibTeX RDF |
Horn clauses with sharing, tiling of Horn clauses, 0-CFA, Program analysis, calculus, ambient calculus |
67 | Michael Mendler, Gerald Lüttgen |
Is Observational Congruence Axiomatisable in Equational Horn Logic? |
CONCUR |
2007 |
DBLP DOI BibTeX RDF |
|
67 | Uwe Bubeck, Hans Kleine Büning, Xishun Zhao |
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
67 | David W. Reed, Donald W. Loveland, Bruce T. Smith |
The Near-Horn Approach to Disjunctive Logic Programming. |
ELP |
1991 |
DBLP DOI BibTeX RDF |
|
67 | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
On Some Aspects of Mixed Horn Formulas. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
Mixed Horn formula, polynomial time reduction, NP-completeness, satisfiability, exact algorithm |
67 | Thomas Eiter, Kazuhisa Makino |
On computing all abductive explanations from a propositional Horn theory. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Horn theories, dualization problem, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, propositional logic, tractability, prime implicates, characteristic set, enumeration algorithms |
67 | Hans van Maaren, Linda van Norden |
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
Horn, satisfiability, density, 3-SAT |
61 | Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau |
Algorithms for Constructing Minimal Deduction Graphs. |
IEEE Trans. Software Eng. |
1989 |
DBLP DOI BibTeX RDF |
MDG construction algorithms, Hern clauses, minimal deduction graphs, Horn clause logic, DG, Horn formulas, positive literals, rule instances, tree space, logic programming, graphs, expert systems, inference mechanisms, transitivity, backtracking, inference rules, reflexivity, arcs, sink, subtrees, HF |
61 | Chao-Chih Yang |
Deduction Graphs: An Algorithm and Applications. |
IEEE Trans. Software Eng. |
1989 |
DBLP DOI BibTeX RDF |
deduction graph, function-free Horn formula, logic queries, artificial intelligence, logic programming, logic programming, relational database, relational databases, expert systems, database theory, inference mechanisms, functional dependency, Horn clauses, polynomial time complexity, rule-based expert systems, inference problem |
58 | R. Chandrasekaran, K. Subramani 0001 |
A Combinatorial Algorithm for Horn Programs. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
58 | Marta Arias, José L. Balcázar |
Canonical Horn Representations and Query Learning. |
ALT |
2009 |
DBLP DOI BibTeX RDF |
|
58 | Ralf Küsters, Tomasz Truderung |
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach. |
CCS |
2008 |
DBLP DOI BibTeX RDF |
security protocols, algebraic properties |
58 | Yusuke Kameda, Atsushi Imiya, Naoya Ohnishi |
A Convergence Proof for the Horn-Schunck Optical-Flow Computation Scheme Using Neighborhood Decomposition. |
IWCIA |
2008 |
DBLP DOI BibTeX RDF |
|
58 | Thomas Eiter, Georg Gottlob, Magdalena Ortiz 0001, Mantas Simkus |
Query Answering in the Description Logic Horn-. |
JELIA |
2008 |
DBLP DOI BibTeX RDF |
|
58 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 |
On the Boolean Connectivity Problem for Horn Relations. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
58 | Marcus Vinicius Santos |
Denotational Semantics Using Horn Concurrent Transaction Logic. |
ICLP |
2005 |
DBLP DOI BibTeX RDF |
|
58 | Hiroki Uejima, Masami Hagiya, Satoshi Kobayashi |
Horn Clause Computation by Self-assembly of DNA Molecules. |
DNA |
2001 |
DBLP DOI BibTeX RDF |
|
58 | Jean-Marc Talbot |
On the Alternation-Free Horn Mu-calculus. |
LPAR |
2000 |
DBLP DOI BibTeX RDF |
|
58 | Michael Dierkes |
Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas. |
LPAR |
1999 |
DBLP DOI BibTeX RDF |
|
58 | Yoshihiko Ohta, Katsumi Inoue, Ryuzo Hasegawa |
On the Relationship Between Non-Horn Magic Sets and Relevancy Testing. |
CADE |
1998 |
DBLP DOI BibTeX RDF |
|
58 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
On Disguised Double Horn Functions and Extensions. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
58 | Xumin Nie |
How Well Are Non-Horn Clauses Handled? |
ISMIS |
1991 |
DBLP DOI BibTeX RDF |
|
58 | Dongbo Liu, Deyi Li |
Fuzzy Reasoning Based on F-Horn Clause Rules. |
ALP |
1988 |
DBLP DOI BibTeX RDF |
|
58 | Alexej P. Pynko |
A relative interpolation theorem for infinitary universal Horn logic and its applications. |
Arch. Math. Log. |
2006 |
DBLP DOI BibTeX RDF |
Universal Horn theory, Interpolation theorem, Preservation theorem, Definability theorem |
58 | Emmanuel Kounalis, Michaël Rusinowitch |
On Word Problems in Horn Theories. |
CADE |
1988 |
DBLP DOI BibTeX RDF |
initial model, inductionless induction, resolution, term-rewriting system, Horn clause, word problems |
58 | Peter L. Hammer, Alexander Kogan |
Essential and redundant rules in Horn knowledge bases. |
HICSS (3) |
1995 |
DBLP DOI BibTeX RDF |
redundant rules, essential rules, Horn knowledge bases, logically equivalent transformations, irredundant prime knowledge base, future simplifications, combinatorial characterizations, computational recognition procedures, essentiality, knowledge based systems, redundancy, redundancy, production rule, Horn clauses, combinatorial mathematics |
53 | Dong-Bo Liu, Zheng-ding Lu |
The Theory of Fuzzy Logic Programming. |
ICFIE |
2007 |
DBLP DOI BibTeX RDF |
Fuzzy Horn Clauses, Fuzzy Proof Theory, Fuzzy Procedural Interpretation, Fuzzy Logic Programming |
53 | Thomas Eiter, Kazuhisa Makino |
Abduction and the Dualization Problem. |
Discovery Science |
2003 |
DBLP DOI BibTeX RDF |
monotone dualization, Horn functions, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, hypergraph transversals |
53 | Jeffrey J. P. Tsai, Thomas J. Weigert, Hung-Chin Jang |
A Hybrid Knowledge Representation as a Basis of Requirement Specification and Specification Analysis. |
IEEE Trans. Software Eng. |
1992 |
DBLP DOI BibTeX RDF |
nonmonotonic Horn clause logic, formal requirement specification language, frame-and-rule oriented requirement specification language, FRORL, surface syntax, hierarchical relationships, formal specification, object oriented, knowledge representation, prototyping, specification languages, inheritance, reusability, frames, software development environment, C language, production rules, multiple inheritance, Horn clauses, logic programming languages, executability, hybrid knowledge representation |
50 | Linh Anh Nguyen |
Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity. |
ICLP |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais |
Computing Horn Strong Backdoor Sets Thanks to Local Search. |
ICTAI |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Cliff Randell, Sara Price, Yvonne Rogers, Eric Charles Harris, Geraldine Fitzpatrick |
The Ambient Horn: designing a novel audio-based learning experience. |
Pers. Ubiquitous Comput. |
2004 |
DBLP DOI BibTeX RDF |
Audio-based learning, Augmented reality, Pervasive computing, Mobile learning |
50 | Zdravko Markov, Ivo Marinchev |
Coverage-Based Semi-distance between Horn Clauses. |
AIMSA |
2000 |
DBLP DOI BibTeX RDF |
|
50 | Ryuzo Hasegawa, Katsumi Inoue, Yoshihiko Ohta, Miyuki Koshimura |
Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. |
CADE |
1997 |
DBLP DOI BibTeX RDF |
|
50 | Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier |
Halting Problem of One Binary Horn Clause is Undecidable. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
50 | Gopalan Nadathur, Dale Miller 0001 |
Higher-Order Horn Clauses |
J. ACM |
1990 |
DBLP DOI BibTeX RDF |
|
49 | Flemming Nielson, Hanne Riis Nielson, Helmut Seidl |
Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. |
SAS |
2002 |
DBLP DOI BibTeX RDF |
uniform Horn clauses, strongly recognizable relations, Program analysis, Spi calculus |
49 | Jack Minker, Arcot Rajasekar |
Procedural Interpretation of Non-Horn Logic Programs. |
CADE |
1988 |
DBLP DOI BibTeX RDF |
generalized closed world assumption, non-horn programs, procedural interpretation, support-for-negation, logic programming, negation |
49 | Chuang Lin 0002, Abhijit Chaudhury, Andrew B. Whinston, Dan C. Marinescu |
Logical Inference of Horn Clauses in Petri Net Models. |
IEEE Trans. Knowl. Data Eng. |
1993 |
DBLP DOI BibTeX RDF |
net model, logical inconsistency check, T-invariants, one-literal, pure-literal, splitting clauses, Petri nets, inference mechanisms, resolution, propositional logic, Horn clauses, Horn clauses, Petri net models, first-order predicate logic, logical inference |
49 | Dana Angluin, Michael Frazier, Leonard Pitt |
Learning Conjunctions of Horn Clauses (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
clauses, Horn clause conjunctions, Horn sentence, disjunction of literals, negated variable, unknown formula, learning algorithm, Boolean formulas, polynomial time complexity, membership queries, equivalence queries |
46 | Jerzy Marcinkowski |
A Horn Clause that Implies and Undecidable Set of Horn Clauses. |
CSL |
1993 |
DBLP DOI BibTeX RDF |
|
44 | Céline Rouveirol, Véronique Ventos |
Towards Learning in CARIN-ALN. |
ILP |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Thomas Eiter, Thomas Lukasiewicz |
New Tractable Cases in Default Reasoning from Conditional Knowledge Bases. |
JELIA |
2000 |
DBLP DOI BibTeX RDF |
|
44 | Thomas S. Jones, Ahmed Louri |
Media Access Protocols For A Scalable Optical Interconnection Network. |
ICPP |
1998 |
DBLP DOI BibTeX RDF |
|
44 | Marco Cadoli, Thomas Eiter, Georg Gottlob |
Complexity of propositional nested circumscription and nested abnormality theories. |
ACM Trans. Comput. Log. |
2005 |
DBLP DOI BibTeX RDF |
Horn theories, nested abnormality theories, computational complexity, nonmonotonic reasoning, knowledge representation and reasoning, Circumscription |
44 | Athanassios Tzouvaras |
The Logic of Multisets Continued: The Case of Disjunction. |
Stud Logica |
2003 |
DBLP DOI BibTeX RDF |
disjunctive multiset, Horn fragment, semantics of the Horn fragment, linear logic, Multiset |
43 | Marina Langlois, Robert H. Sloan, Balázs Szörényi, György Turán |
Horn Complements: Towards Horn-to-Horn Belief Revision. |
AAAI |
2008 |
DBLP BibTeX RDF |
|
43 | Bishoksan Kafle, John P. Gallagher, Pierre Ganty |
Solving non-linear Horn clauses using a linear Horn clause solver. |
HCVS@ETAPS |
2016 |
DBLP DOI BibTeX RDF |
|
41 | Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán |
Combinatorial Problems for Horn Clauses. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
|
41 | John P. Gallagher, Mads Rosendahl |
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation. |
LPAR |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Christoffer Rosenkilde Nielsen, Flemming Nielson, Hanne Riis Nielson |
Iterative Specialisation of Horn Clauses. |
ESOP |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Xianfei Tang, Changjun Jiang, Zhijun Ding |
Automatic Web Service Composition Based on Logical Inference of Horn Clauses in Petri Net Models. |
ICWS |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Marina Langlois, Robert H. Sloan, György Turán |
Horn Upper Bounds and Renaming. |
SAT |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Max I. Kanovich |
The Expressive Power of Horn Monadic Linear Logic. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Philippe Balbiani, Jean-François Condotta, Gérard Ligozat |
Reasoning about Generalized Intervals: Horn Representability and Tractability. |
TIME |
2000 |
DBLP DOI BibTeX RDF |
|
41 | Roni Khardon |
Learning Range Restricted Horn Expressions. |
EuroCOLT |
1999 |
DBLP DOI BibTeX RDF |
|
41 | Wenjin Lu, Ulrich Furbach |
Disjunctive Logic Program = Horn Program + Control Program. |
JELIA |
1998 |
DBLP DOI BibTeX RDF |
|
41 | Xumin Nie, Qing Guo |
Renaming a Set of Non-Horn Clauses. |
ISMIS |
1997 |
DBLP DOI BibTeX RDF |
|
41 | Stefania Costantini, Pierangelo Dell'Acqua, Gaetano Aurelio Lanzarone |
Extending Horn Clause Theories by Reflection Principles. |
JELIA |
1994 |
DBLP DOI BibTeX RDF |
|
41 | Erich Grädel |
The Expressive Power of Second Order Horn Logic. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
41 | Alexander Leitsch |
Deciding Horn Classes by Hyperresolution. |
CSL |
1989 |
DBLP DOI BibTeX RDF |
|
41 | Shan Chi, Lawrence J. Henschen |
Recursive Query Answering with Non-Horn Clauses. |
CADE |
1988 |
DBLP DOI BibTeX RDF |
|
41 | Roland Dietrich |
Relating Resolution and Algebraic Completion for Horn Logic. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
41 | Radim Belohlávek, Vilém Vychodil |
Fuzzy Horn logic I. |
Arch. Math. Log. |
2006 |
DBLP DOI BibTeX RDF |
Degree of provability, Fuzzy logic, Implication, Equational logic, Horn logic |
41 | Radim Belohlávek, Vilém Vychodil |
Fuzzy Horn logic II. |
Arch. Math. Log. |
2006 |
DBLP DOI BibTeX RDF |
Degree of provability, Fuzzy logic, Implication, Equational Logic, Horn logic |
41 | Sven Hartmann, Sebastian Link |
Horn clauses and functional dependencies in complex-value databases. |
ADC |
2006 |
DBLP BibTeX RDF |
logic in databases, functional dependency, Horn clause, complex values, implication problem |
41 | Dale Miller 0001 |
Collection analysis for Horn clause programs. |
PPDP |
2006 |
DBLP DOI BibTeX RDF |
static analysis, linear logic, Horn clauses, proof search |
41 | José Oscar Olmedo-Aguirre, Guillermo Morales-Luna |
Indeed : Interactive Deduction on Horn Clause Theories. |
IBERAMIA |
2002 |
DBLP DOI BibTeX RDF |
Horn clause theories, interaction, Logic programming, automated theorem proving |
41 | Ashok K. Chandra, David Harel |
Horn Clauses and the Fixpoint Query Hierarchy. |
PODS |
1982 |
DBLP DOI BibTeX RDF |
logic program, PROLOG, query language, horn clause, relational data base |
35 | Michael Minock, Hansi Kraus |
Z-log: Applying System-Z. |
JELIA |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Edgar Altamirano, Gonzalo Escalada-Imaz |
Finding Tractable Formulas in NNF. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
|
35 | Sang-goo Lee, Dong-Hoon Choi, Sang-Ho Lee |
A Logic Database System with Extended Functionality. |
COMPSAC |
1996 |
DBLP DOI BibTeX RDF |
|
35 | Helmut Seidl, Kumar Neeraj Verma |
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. |
ACM Trans. Comput. Log. |
2008 |
DBLP DOI BibTeX RDF |
instantiation-based theorem proving, Cryptographic protocols, first-order logic, resolution, Horn clauses |
35 | Hans van Maaren, Linda van Norden |
Hidden Threshold Phenomena for Fixed-Density SAT-formulae. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
Horn, graph-3-coloring, satisfiability, thresholds, 3-SAT |
35 | Flemming Nielson, Hanne Riis Nielson, Helmut Seidl |
Automatic Complexity Analysis. |
ESOP |
2002 |
DBLP DOI BibTeX RDF |
automatic complexity analysis, Program analysis, sparseness, Horn clauses |
35 | Xiaochun Cheng, Haihong Dai |
Operator Fuzzy Logic Based on Argumentation. |
HICSS (5) |
1998 |
DBLP DOI BibTeX RDF |
Operator Fuzzy Logic, argumentation, conflict resolution, nonmonotonic reasoning, Horn clause |
35 | Omar E. Vaga, Yee-Hong Yang |
Shading Logic: A Heuristic Approach to Recover Shape from Shading. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1993 |
DBLP DOI BibTeX RDF |
heuristic-based algorithm, shading logic, Brooks and Horn algorithm, computer vision, computer vision, computer graphics, computer graphics, shape from shading, superquadrics |
35 | Tadao Murata, Du Zhang |
A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs. |
IEEE Trans. Software Eng. |
1988 |
DBLP DOI BibTeX RDF |
AND/OR parallelisms, deduction process, Horn clause logic programs, Petri nets, logic programming, communicating processes, fixpoint semantics, predicate/transition nets, relational operations |
34 | Jeffrey Horn |
Coevolving species for shape nesting. |
Congress on Evolutionary Computation |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Leonardo Horn Iwaya, Gabriel Horn Iwaya, Simone Fischer-Hübner, Andrea Valéria Steil |
Organisational Privacy Culture and Climate: A Scoping Review. |
IEEE Access |
2022 |
DBLP DOI BibTeX RDF |
|
32 | Stefano Ferilli, Marenglen Biba, Nicola Di Mauro, Teresa Maria Altomare Basile, Floriana Esposito |
Plugging Taxonomic Similarity in First-Order Logic Horn Clauses Comparison. |
AI*IA |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Kazuhisa Makino, Hirotaka Ono 0001 |
Deductive Inference for the Interiors and Exteriors of Horn Theories. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz |
Computation of Renameable Horn Backdoors. |
SAT |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Ethan K. Jackson, Wolfram Schulte |
Model Generation for Horn Logic with Stratified Negation. |
FORTE |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Theofilos P. Mailis, Giorgos Stoilos, Giorgos B. Stamou |
Expressive Reasoning with Horn Rules and Fuzzy Description Logics. |
RR |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Helmut Seidl, Kumar Neeraj Verma |
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. |
Program Analysis and Compilation |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Uwe Bubeck, Hans Kleine Büning |
Dependency Quantified Horn Formulas: Models and Complexity. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Linh Anh Nguyen |
A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic ALC. |
JELIA |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Qian Wang 0024, Gopal Gupta 0001, Michael Leuschel |
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics. |
PADL |
2005 |
DBLP DOI BibTeX RDF |
|
32 | José L. Balcázar, Gemma Casas-Garriga |
On Horn Axiomatizations for Sequential Data. |
ICDT |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Amar Mitiche, Abdol-Reza Mansouri |
On convergence of the Horn and Schunck optical-flow estimation method. |
IEEE Trans. Image Process. |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3547 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|